Studia Logica 38 (2):137 - 147 (1979)
|Abstract||The subsystem S of Parry's AI  (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is arguably the most relevant relevant logic known at this time to be decidable.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Hajnal Andréka & Szabolcs Mikulás (1994). Lambek Calculus and its Relational Semantics: Completeness and Incompleteness. Journal of Logic, Language and Information 3 (1):1-37.
Giovanna Corsi (2002). A Unified Completeness Theorem for Quantified Modal Logics. Journal of Symbolic Logic 67 (4):1483-1510.
Takahiro Seki (2003). A Sahlqvist Theorem for Relevant Modal Logics. Studia Logica 73 (3):383 - 411.
Viorica Sofronie-Stokkermans (2000). Duality and Canonical Extensions of Bounded Distributive Lattices with Operators, and Applications to the Semantics of Non-Classical Logics II. Studia Logica 64 (2):151-172.
M. J. Cresswell (1982). Urn Models: A Classical Exposition. Studia Logica 41 (2-3):109 - 130.
Barbara F. Csima (2004). Degree Spectra of Prime Models. Journal of Symbolic Logic 69 (2):430 - 442.
Gerard Allwein & Wendy MacCaull (2001). A Kripke Semantics for the Logic of Gelfand Quantales. Studia Logica 68 (2):173-228.
D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.
Douglas Cenzer & Jeffrey B. Remmel (2006). Complexity, Decidability and Completeness. Journal of Symbolic Logic 71 (2):399 - 424.
Added to index2009-01-28
Total downloads6 ( #145,498 of 549,007 )
Recent downloads (6 months)0
How can I increase my downloads?