Level Compactness

Notre Dame Journal of Formal Logic 47 (4):545-555 (2006)
The concept of compactness is a necessary condition of any system that is going to call itself a finitary method of proof. However, it can also apply to predicates of sets of formulas in general and in that manner it can be used in relation to level functions, a flavor of measure functions. In what follows we will tie these concepts of measure and compactness together and expand some concepts which appear in d'Entremont's master's thesis, "Inference and Level." We will also provide some applications of the concept of level to the "preservationist" program of paraconsistent logic. We apply the finite level compactness theorem in this paper to get a Lindenbaum flavor extension lemma and a maximal "forcibility" theorem. Each of these is based on an abstract deductive system X which satisfies minimal conditions of inference and has generalizations of 'and' and 'not' as logical words.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1168352667
 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: 22,184
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
Alexander Paseau (2011). Proofs of the Compactness Theorem. History and Philosophy of Logic 31 (1):73-98.
Michael Scanlan (1983). On Finding Compactness in Aristotle. History and Philosophy of Logic 4 (1&2):1-8.
John M. Vickers (1990). Compactness in Finite Probabilistic Inference. Journal of Philosophical Logic 19 (3):305 - 316.

Monthly downloads

Added to index


Total downloads

15 ( #252,962 of 1,934,793 )

Recent downloads (6 months)

1 ( #434,672 of 1,934,793 )

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.