Journal of Symbolic Logic

On the non-confluence of cut-elimination

Matthias Baaz and Stefan Hetzl

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

We study cut-elimination in first-order classical logic. We construct a sequence of polynomial-length proofs having a non-elementary number of different cut-free normal forms. These normal forms are different in a strong sense: they not only represent different Herbrand-disjunctions but also differ in their propositional structure.

This result illustrates that the constructive content of a proof in classical logic is not uniquely determined but rather depends on the chosen method for extracting it.

Article information

Source
J. Symbolic Logic, Volume 76, Issue 1 (2011), 313-340.

Dates
First available in Project Euclid: 4 January 2011

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1294171002

Digital Object Identifier
doi:10.2178/jsl/1294171002

Mathematical Reviews number (MathSciNet)
MR2791350

Zentralblatt MATH identifier
1220.03048

Citation

Baaz, Matthias; Hetzl, Stefan. On the non-confluence of cut-elimination. J. Symbolic Logic 76 (2011), no. 1, 313--340. doi:10.2178/jsl/1294171002. https://projecteuclid.org/euclid.jsl/1294171002


Export citation