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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Indestructibility and the Level-by-Level Agreement Between Strong Compactness and Supercompactness.Arthur W. Apter & Joel David Hamkins - 2002 - Journal of Symbolic Logic 67 (2):820-840.
Proofs of the Compactness Theorem.Alexander Paseau - 2010 - History and Philosophy of Logic 31 (1):73-98.
A Proofless Proof of the Barwise Compactness Theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Generalized Logical Consequence: Making Room for Induction in the Logic of Science. [REVIEW]Samir Chopra & Eric Martin - 2002 - Journal of Philosophical Logic 31 (3):245-280.
Generalizations of Kochen and Specker's Theorem and the Effectiveness of Gleason's Theorem.Itamar Pitowsky - 2004 - Studies in History and Philosophy of Science Part B 35 (2):177-194.
On Finding Compactness in Aristotle.Michael Scanlan - 1983 - History and Philosophy of Logic 4 (1&2):1-8.
The Compactness of First-Order Logic:From Gödel to Lindström.John W. Dawson - 1993 - History and Philosophy of Logic 14 (1):15-37.
Minimally Generated Abstract Logics.Steffen Lewitzka & Andreas B. M. Brunner - 2009 - Logica Universalis 3 (2):219-241.
Measurability and Degrees of Strong Compactness.Arthur W. Apter - 1981 - Journal of Symbolic Logic 46 (2):249-254.
Compactness Versus Interior-to-Edge Ratio; Two Approaches for Habitat's Ranking.Attila R. Imre - 2006 - Acta Biotheoretica 54 (1):21-26.
Inverse Topological Systems and Compactness in Abstract Model Theory.Daniele Mundici - 1986 - Journal of Symbolic Logic 51 (3):785-794.
Compactness in Finite Probabilistic Inference.John M. Vickers - 1990 - Journal of Philosophical Logic 19 (3):305 - 316.
On an Unsound Proof of the Existence of Possible Worlds.Christopher Menzel - 1989 - Notre Dame Journal of Formal Logic 30 (4):598-603.
Added to index2010-08-24
Total downloads15 ( #299,742 of 2,044,886 )
Recent downloads (6 months)1 ( #396,194 of 2,044,886 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.