On decidable consequence operators
Studia Logica 45 (4):415 - 424 (1986)
| Abstract | The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
|
| Through your library | Configure |
Arnold Koslow (2007). Structuralist Logic: Implications, Inferences, and Consequences. Logica Universalis 1 (1).
Adam Kolany (1997). Consequence Operations Based on Hypergraph Satisfiability. Studia Logica 58 (2):261-272.
Beata Konikowska (1990). A Two-Valued Logic for Reasoning About Different Types of Consequence in Kleene's Three-Valued Logic. Studia Logica 49 (4):541 - 555.
Dimiter Vakarelov (1995). A Duality Between Pawlak's Knowledge Representation Systems and Bi-Consequence Systems. Studia Logica 55 (1):205 - 228.
Leon Horsten & Philip Welch (2007). The Undecidability of Propositional Adaptive Logic. Synthese 158 (1):41 - 60.
Andrzej W. Jankowski (1985). Disjunctions in Closure Spaces. Studia Logica 44 (1):11 - 24.
Jürg Kohlas & Robert F. Stärk (2007). Information Algebras and Consequence Operators. Logica Universalis 1 (1).
Andrzej W. Jankowski (1985). Universality of the Closure Space of Filters in the Algebra of All Subsets. Studia Logica 44 (1):1 - 9.
Brunetto Piochi (1983). Logical Matrices and Non-Structural Consequence Operators. Studia Logica 42 (1):33 - 42.
Robert A. Herrmann (2007). General Logic-Systems and Finite Consequence Operators. Logica Universalis 1 (1).
Monthly downloads |
Added to index2009-01-28Total downloads10 ( #106,175 of 549,005 )Recent downloads (6 months)0How can I increase my downloads? |

