Sciweavers

JSYML
2011

On the non-confluence of cut-elimination

13 years 7 months ago
On the non-confluence of cut-elimination
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength 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.
Matthias Baaz, Stefan Hetzl
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where JSYML
Authors Matthias Baaz, Stefan Hetzl
Comments (0)