About finite predicate logic

Studia Logica 45 (4):405 - 414 (1986)
Abstract
We say that an n-argument predicate P n is finite, if P is a finite set. Note that the set of individuals is infinite! Finite predicates are useful in data bases and in finite mathematics. The logic DBL proposed here operates on finite predicates only. We construct an imbedding for DBL in a special modal logic MPL. We prove that if a finite predicate is expressible in the classical logic, it is also expressible in DBL. Quantifiers are not necessary in DBL. Some simple algebraic properties of DBL are indicated.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    2 ( #258,237 of 1,088,810 )

    Recent downloads (6 months)

    1 ( #69,666 of 1,088,810 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.