Journal of Symbolic Logic

Intuitionistic logic freed of all metarules

Giovanna Corsi and Gabriele Tassi

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
J. Symbolic Logic Volume 72, Issue 4 (2007), 1204-1218.

Dates
First available in Project Euclid: 18 February 2008

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1203350782

Digital Object Identifier
doi:10.2178/jsl/1203350782

Mathematical Reviews number (MathSciNet)
MR2371201

Zentralblatt MATH identifier
1160.03037

Citation

Corsi, Giovanna; Tassi, Gabriele. Intuitionistic logic freed of all metarules. Journal of Symbolic Logic 72 (2007), no. 4, 1204--1218. doi:10.2178/jsl/1203350782. http://projecteuclid.org/euclid.jsl/1203350782.


Export citation