About finite predicate logic

Studia Logica 45 (4):405 - 414 (1986)
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)
DOI 10.1007/BF00370273
 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: 23,209
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

35 ( #135,010 of 1,941,073 )

Recent downloads (6 months)

25 ( #20,921 of 1,941,073 )

How can I increase my downloads?

My notes
Sign in to use this feature

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