Results 1 
5 of
5
Hilbert’s Program Then and Now
, 2005
"... Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and els ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and elsewhere in the 1920s
The epsilon calculus and Herbrand Complexity
 STUDIA LOGICA
, 2006
"... Hilbert’s εcalculus is based on an extension of the language of predicate logic by a termforming operator εx. Two fundamental results about the εcalculus, the first and second epsilon theorem, play a rôle similar to that which the cutelimination theorem plays in sequent calculus. In particular ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Hilbert’s εcalculus is based on an extension of the language of predicate logic by a termforming operator εx. Two fundamental results about the εcalculus, the first and second epsilon theorem, play a rôle similar to that which the cutelimination 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.
Hilbert’s “Verunglückter Beweis,” the first epsilon theorem and consistency proofs. History and Philosophy of Logic
"... Abstract. On the face of it, Hilbert’s Program was concerned with proving consistency of mathematical systems in a finitary way. This was to be accomplished by showing that that these systems are conservative over finitistically interpretable and obviously sound quantifierfree subsystems. One propo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. On the face of it, Hilbert’s Program was concerned with proving consistency of mathematical systems in a finitary way. This was to be accomplished by showing that that these systems are conservative over finitistically interpretable and obviously sound quantifierfree subsystems. One proposed method of giving such proofs is Hilbert’s epsilonsubstitution method. There was, however, a second approach which was not refelected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert’s first epsilon theorem and a certain “general consistency result. ” An analysis of this socalled “failed proof ” lends further support to an interpretation of Hilbert according to which he was expressly concerned with conservatitvity proofs, even though his publications only mention consistency as the main question. §1. Introduction. The aim of Hilbert’s program for consistency proofs in the 1920s is well known: to formalize mathematics, and to give finitistic consistency proofs of these systems and thus to put mathematics on a “secure foundation.” What is perhaps less well known is exactly how Hilbert thought this should be carried out. Over ten years before Gentzen developed sequent calculus formalizations
FRAGMENT OF NONSTANDARD ANALYSIS WITH A FINITARY CONSISTENCY PROOF
"... We introduce a nonstandard arithmetic NQA − based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA +), with a weakened external open minimization schema. A finitary consistency proof for NQA − formalizable in PRA is presented. We also show interesting facts about ..."
Abstract
 Add to MetaCart
We introduce a nonstandard arithmetic NQA − based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA +), with a weakened external open minimization schema. A finitary consistency proof for NQA − formalizable in PRA is presented. We also show interesting facts about the strength of the theories NQA − and NQA +; NQA − is mutually interpretable with I∆0 + EXP, and on the other hand, NQA + interprets the theories IΣ1 and WKL0.
G.Moser R.Zach The Epsilon Calculus and
, 2005
"... Abstract. Hilbert’s εcalculus is based on an extension of the language of predicate logic by a termforming operator εx. Two fundamental results about the εcalculus, the first and second epsilon theorem, play a rôle similar to that which the cutelimination theorem plays in sequent calculus. In pa ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Hilbert’s εcalculus is based on an extension of the language of predicate logic by a termforming operator εx. Two fundamental results about the εcalculus, the first and second epsilon theorem, play a rôle similar to that which the cutelimination 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. Keywords: Hilbert’s εcalculus, epsilon theorems, Herbrand’s theorem, proof complexity 1.