University of Calgary
UofC Navigation

The epsilon calculus and Herbrand complexity

Source

Studia Logica 82 (2006) 133-155
(with Georg Moser)

Abstract

Hilbert’s ?-calculus is based on an extension of the language of predicate logic by a term-forming operator ?x. Two fundamental results about the ?-calculus, the first and second epsilon theorem, play a role similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand’s Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential theorems obtained by this elimination procedure.

Review

Mathematical Reviews 2205042 (2006k:03127) (Mitsuru Yasuhara) 

Download from SpringerLink

doi:10.1007/s11225-006-6610-7

Download preprint

Download Preprint