Socratic Trees

Authors:
Dorota Leszczyńska-Jasion;Mariusz Urbański;Andrzej Wiśniewski
Affiliations:
Chair of Logic and Cognitive Science, Adam Mickiewicz University, Poznań, Poland 60-586;Chair of Logic and Cognitive Science, Adam Mickiewicz University, Poznań, Poland 60-586;Chair of Logic and Cognitive Science, Adam Mickiewicz University, Poznań, Poland 60-586
Venue:
Studia Logica
Year:
2013

Citing 3
Cited 0

Taxonomic syntax for first order inference

Journal of the ACM (JACM)
The method of hypersequents in the proof theory of propositional non-classical logics

Logic: from foundations to applications
Basic proof theory (2nd ed.)

Basic proof theory (2nd ed.)

Quantified Score

Hi-index	0.00

Visualization

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.