Abstract
In the paper we study the method of Socratic proofs in the intuitionistic propositional logic as a reduction procedure. Our approach consists in constructing for a given sequent α a finite tree of sets of sequents by using invertible reduction rules of the kind: ? is valid if and only if ?1 is valid or... or ?n is valid. From such a tree either a Gentzen-style proof of α or an Aristotle-style refutation of α can also be extracted
Keywords No keywords specified (fix it)
Categories (categorize this paper)
ISBN(s)
DOI 10.3166/jancl.15.453-464
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,261
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Contraction-Free Sequent Calculi for Intuitionistic Logic.Roy Dyckhoff - 1992 - Journal of Symbolic Logic 57 (3):795-807.
Socratic Proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Socratic Proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.
A Proof-Search Procedure for Intuitionistic Propositional Logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.
Finite Sets and Natural Numbers in Intuitionistic TT.Daniel Dzierzgowski - 1996 - Notre Dame Journal of Formal Logic 37 (4):585-601.
Gentzen’s Consistency Proof Without Heightlines.Annika Siders - 2013 - Archive for Mathematical Logic 52 (3-4):449-468.

Analytics

Added to PP index
2013-11-24

Total views
14 ( #712,936 of 2,455,886 )

Recent downloads (6 months)
1 ( #449,201 of 2,455,886 )

How can I increase my downloads?

Downloads

My notes