A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A proof-theoretical investigation of Zantema's problem
[chapter]

1998
*
Lecture Notes in Computer Science
*

We present a concrete example of how one can extract constructive content from a non{constructive proof. The proof investigated is a termination proof of the string{rewriting system 1100 ! 000111. This rewriting system is self{embedding, so the standard termination techniques which rely on Kruskal's Tree Theorem cannot be applied directly. Dershowitz and Hoot 3] have given a classical termination proof using a minimal bad sequence argument. We analyse their proof and give a constructive

doi:10.1007/bfb0028014
fatcat:wzefresu6rfahc45omf45gbeom