Intuitionistic Logic Freed of All Metarules

Journal of Symbolic Logic 72 (4):1204 - 1218 (2007)
Abstract
In this paper we present two calculi for intuitionistic logic. The first one, IG, is characterized by the fact that every proof-search terminates and termination is reached without jeopardizing the subformula property. As to the second one, SIC, proof-search terminates, the subformula property is preserved and moreover proof-search is performed without any recourse to metarules, in particular there is no need to back-track. As a consequence, proof-search in the calculus SIC is accomplished by a single tree as in classical logic
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1203350782
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,215
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
Semantic Trees for Dummett's Logic LC.Giovanna Corsi - 1986 - Studia Logica 45 (2):199-206.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Partial Isomorphisms and Intuitionistic Logic.Bernd I. Dahn - 1981 - Studia Logica 40 (4):405 - 413.
Semi-Intuitionistic Logic.Juan Manuel Cornejo - 2011 - Studia Logica 98 (1-2):9-25.
Negationless Intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Axioms for Classical, Intuitionistic, and Paraconsistent Hybrid Logic.Torben Braüner - 2006 - Journal of Logic, Language and Information 15 (3):179-194.
Combining Possibilities and Negations.Greg Restall - 1997 - Studia Logica 59 (1):121-141.

Monthly downloads

Added to index

2010-08-24

Total downloads

15 ( #312,813 of 2,164,576 )

Recent downloads (6 months)

1 ( #347,948 of 2,164,576 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums