Studia Logica 89 (3):365-399 (2008)
| Authors |
|
| Abstract |
The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5.
|
| Keywords | Philosophy Computational Linguistics Mathematical Logic and Foundations Logic |
| Categories | (categorize this paper) |
| DOI | 10.1007/s11225-008-9134-5 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
First-Order Logic.Raymond Merrill Smullyan - 1968 - Berlin, Germany: New York [Etc.]Springer-Verlag.
A New Introduction to Modal Logic.Paolo Crivelli, Timothy Williamson, G. E. Hughes & M. J. Cresswell - 1998 - Philosophical Review 107 (3):471.
View all 17 references / Add more references
Citations of this work BETA
Socratic Trees.Dorota Leszczyńska-Jasion, Mariusz Urbański & Andrzej Wiśniewski - 2013 - Studia Logica 101 (5):959-986.
Dual Erotetic Calculi and the Minimal LFI.Szymon Chlebowski & Dorota Leszczyńska-Jasion - 2015 - Studia Logica 103 (6):1245-1278.
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151-177.
Rasiowa–Sikorski Deduction Systems with the Rule of Cut: A Case Study.Dorota Leszczyńska-Jasion, Mateusz Ignaszak & Szymon Chlebowski - 2019 - Studia Logica 107 (2):313-349.
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.
View all 7 citations / Add more citations
Similar books and articles
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.
The Method of Socratic Proofs for Normal Modal Propositional Logics.Dorota Leszczynska-Jasion - 2007 - Wydawn. Naukowe Uniwersytetu Im. Adama Mickiewicza.
The Method of Socratic Proofs for Normal Modal Propositional Logics.Dorota Leszczyńska - 2007 - Wydawn. Naukowe Uniwersytetu Im. Adama Mickiewicza.
Socratic Proofs From Modal Normal Propositional Logics.Dorota Leszczynska - 2004 - Logique Et Analyse 47.
Socratic Proofs for Some Normal Modal Propositional Logics.D. Leszczyńska - 2004 - Logique Et Analyse 47 (No. 185–188):259-285.
Socratic Trees.Dorota Leszczyńska-Jasion, Mariusz Urbański & Andrzej Wiśniewski - 2013 - Studia Logica 101 (5):959-986.
Free-Variable Tableaux for Propositional Modal Logics.Bernhard Beckert & Rajeev GorÉ - 2001 - Studia Logica 69 (1):59-96.
On Some Method Of Axiomatization Of Some Propositional Calculi.Zdzislaw Dywan - 1986 - Bulletin of the Section of Logic 15 (2):52-56.
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151-177.
Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Variants of Multi-Relational Semantics for Propositional Non-Normal Modal Logics.Erica Calardo & Antonino Rotolo - 2014 - Journal of Applied Non-Classical Logics 24 (4):293-320.
Kripke Bundles for Intermediate Predicate Logics and Kripke Frames for Intuitionistic Modal Logics.Nobu-Yuki Suzuki - 1990 - Studia Logica 49 (3):289-306.
Propositional Identity and Logical Necessity.David B. Martens - 2004 - Australasian Journal of Logic 2:1-11.
A Method to Single Out Maximal Propositional Logics with the Disjunction Property I.Mauro Ferrari & Pierangelo Miglioli - 1995 - Annals of Pure and Applied Logic 76 (1):1-46.
Analytics
Added to PP index
2009-01-28
Total views
35 ( #325,179 of 2,506,405 )
Recent downloads (6 months)
1 ( #416,997 of 2,506,405 )
2009-01-28
Total views
35 ( #325,179 of 2,506,405 )
Recent downloads (6 months)
1 ( #416,997 of 2,506,405 )
How can I increase my downloads?
Downloads
