Journal of Philosophical Logic 33 (3):299-326 (2004)
|Abstract||Our aim is to express in exact terms the old idea of solving problems by pure questioning. We consider the problem of derivability: "Is A derivable from Δ by classical propositional logic?". We develop a calculus of questions E*; a proof (called a Socratic proof) is a sequence of questions ending with a question whose affirmative answer is, in a sense, evident. The calculus is sound and complete with respect to classical propositional logic. A Socratic proof in E* can be transformed into a Gentzen-style proof in some sequent calculi. Next we develop a calculus of questions E**; Socratic proofs in E** can be transformed into analytic tableaux. We show that Socratic proofs can be grounded in Inferential Erotetic Logic. After a slight modification, the analyzed systems can also be viewed as hypersequent calculi|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Dorota Leszczynska (2007). The Method of Socratic Proofs for Normal Modal Propositional Logics. Wydawn. Naukowe Uniwersytetu Im. Adama Mickiewicza.
Dorota Leszczyńska-Jasion (2008). The Method of Socratic Proofs for Modal Propositional Logics: K5, S4.2, S4.3, S4f, S4r, S4m and G. Studia Logica 89 (3):365 - 399.
Roy Dyckhoff & Sara Negri (2000). Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. Journal of Symbolic Logic 65 (4):1499-1518.
Rajeev Gore, Linda Postniece & Alwen Tiu, Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.
Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi (2001). Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. Journal of Symbolic Logic 66 (1):171-191.
Maria Luisa Bonet & Samuel R. Buss (1993). The Deduction Rule and Linear and Near-Linear Proof Simulations. Journal of Symbolic Logic 58 (2):688-709.
Andrzej Wiśniewski, Guido Vanackere & Dorota Leszczyńska (2005). Socratic Proofs and Paraconsistency: A Case Study. Studia Logica 80 (2-3):431 - 466.
Andrzej Wiśniewski & Vasilyi Shangin (2006). Socratic Proofs for Quantifiers★. Journal of Philosophical Logic 35 (2):147 - 178.
George Tourlakis (2010). On the Proof-Theory of Two Formalisations of Modal First-Order Logic. Studia Logica 96 (3):349-373.
Dorota Leszczynska-Jasion (2007). The Method of Socratic Proofs for Normal Modal Propositional Logics. Wydawn. Naukowe Uniwersytetu Im. Adama Mickiewicza.
Added to index2009-01-28
Total downloads10 ( #114,394 of 722,929 )
Recent downloads (6 months)1 ( #61,087 of 722,929 )
How can I increase my downloads?