Graduate studies at Western
Studia Logica 81 (1):99 - 122 (2005)
|Abstract||Compactness is an important property of classical propositional logic. It can be defined in two equivalent ways. The first one states that simultaneous satisfiability of an infinite set of formulae is equivalent to the satisfiability of all its finite subsets. The second one states that if a set of formulae entails a formula, then there is a finite subset entailing this formula as well. In propositional many-valued logic, we have different degrees of satisfiability and different possible definitions of entailment, hence the questions of compactness is more complex. In this paper we will deal with compactness of Gödel, GödelΔ, and Gödel∼ logics.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Katsumi Sasaki (1990). The Simple Substitution Property of Gödel's Intermediate Propositional Logics Sn's. Studia Logica 49 (4):471 - 481.
Mark Howard (1988). A Proofless Proof of the Barwise Compactness Theorem. Journal of Symbolic Logic 53 (2):597-602.
C. G. Fermüller (2008). Dialogue Games for Many-Valued Logics — an Overview. Studia Logica 90 (1):43 - 68.
Walter A. Carnielli (1987). Systematization of Finite Many-Valued Logics Through the Method of Tableaux. Journal of Symbolic Logic 52 (2):473-493.
Alexander Paseau (2011). Proofs of the Compactness Theorem. History and Philosophy of Logic 31 (1):73-98.
Daniele Mundici (1986). Inverse Topological Systems and Compactness in Abstract Model Theory. Journal of Symbolic Logic 51 (3):785-794.
Stéphane Demri & Ewa Orłowska (1999). Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae. Studia Logica 62 (2):177 - 200.
Steffen Lewitzka & Andreas B. M. Brunner (2009). Minimally Generated Abstract Logics. Logica Universalis 3 (2):219-241.
John W. Dawson (1993). The Compactness of First-Order Logic:From Gödel to Lindström. History and Philosophy of Logic 14 (1):15-37.
Richard Zach (2007). First-Order Gödel Logics. Annals of Pure and Applied Logic 147:23-47.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?