Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 72, Issue 4 (2007), 1204-1218.
Intuitionistic logic freed of all metarules
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.
J. Symbolic Logic, Volume 72, Issue 4 (2007), 1204-1218.
First available in Project Euclid: 18 February 2008
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Corsi, Giovanna; Tassi, Gabriele. Intuitionistic logic freed of all metarules. J. Symbolic Logic 72 (2007), no. 4, 1204--1218. doi:10.2178/jsl/1203350782. https://projecteuclid.org/euclid.jsl/1203350782