The Epsilon Calculus and Herbrand Complexity

Details The Epsilon Calculus and Herbrand Complexity The Epsilon Calculus and Herbrand Complexity

2005-10-28

arxiv.org/abs/math/0510640v1

Mathematics

Logic

23 pp

Scientific paper

Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-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.

Affiliated with

Also associated with

No associations

Rating

The Epsilon Calculus and Herbrand Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Epsilon Calculus and Herbrand Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Epsilon Calculus and Herbrand Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-500678