Socratic Trees
Authors:
- Dorota Leszczyńska-Jasion,
- Mariusz Urbański,
- Andrzej Wiśniewski
Abstract
The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an application of the SP-method is a sequence of questions, called a Socratic transformation. Our aim is to give a method of translation of Socratic transformations into trees. We address this issue both conceptually and by providing certain algorithms. We show that the trees which correspond to successful Socratic transformations-that is, to Socratic proofs-may be regarded, after a slight modification, as Gentzen-style proofs. Thus proof-search for some Gentzen-style calculi can be performed by means of the SP-method. At the same time the method seems promising as a foundation for automated deduction. © 2012 Springer Science+Business Media B.V.
- Record ID
- UAM0eb9f529796147c6bcfc837cef97d5f6
- Author
- Journal series
- Studia Logica, ISSN 0039-3215, [1572-8730]
- Issue year
- 2013
- Vol
- 101
- No
- 5
- Pages
- 959-986
- ASJC Classification
- ;
- DOI
- DOI:10.1007/s11225-012-9404-0 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 20
- Score source
- journalList
- Score
- Publication indicators
- = 8; = 10; : 2013 = 0.905; : 2013 (2 years) = 0.330 - 2015 (5 years) =0.574
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM0eb9f529796147c6bcfc837cef97d5f6/
- URN
urn:amu-prod:UAM0eb9f529796147c6bcfc837cef97d5f6
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.