Results 1 -
3 of
3
Gödels reformulation of Gentzen’s first consistency proof for arithmetic: the no-counterexample interpretation
- The. Bulletin of Symbolic Logic
, 2005
"... Abstract. The last section of “Lecture at Zilsel’s ” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s first version of his consistency proof for P A [8], reformulating it as what has come to be called the no-counterexample interpretation. I will describe Gentzen’s result ( ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. The last section of “Lecture at Zilsel’s ” [9, §4] contains an interesting but quite condensed discussion of Gentzen’s first version of his consistency proof for P A [8], reformulating it as what has come to be called the no-counterexample interpretation. I will describe Gentzen’s result (in game-theoretic terms), fill in the details (with some corrections) of Gödel’s reformulation, and discuss the relation between the two proofs. 1. Let me begin with a description of Gentzen’s consistency proof. As had already been noted in [5], we may express it in terms of a game. 1 To simplify things, we can assume that the logical constants of the classical system of number theory, P A, are ∧, ∨, ∀ and ∃ and that negations are applied only to atomic formulas. ¬φ in general is represented by the complement φ of φ, obtained by interchanging ∧ with ∨, ∀ with ∃, and atomic sentences with their negations. The components of the sentences φ ∨ ψ and φ ∧ ψ are φ and ψ. The components of the sentences ∃xφ(x) and ∀xφ(x) are the sentences φ(¯n) for each numeral ¯n. A ∧- or ∀-sentence, called a �-sentence, is thus expressed by the conjunction of its components and a ∨- or ∃-sentence, called a �-sentence, is expressed by the disjunction of them; and so it follows that every sentence can be represented as an infinitary propositional formula built up from prime sentences— atomic or negated atomic sentences. Disjunctive and conjunctive sentences with the components φn (where the range of n is 1, 2 or ω) will be denoted respectively by
On Herbrand's Theorem
- In Logic and Computational Complexity
, 1995
"... We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand's theorem which applies only to ##-formulas; but the original statement of Herbrand's theorem applied to arbitrary first-order formula ..."
Abstract
- Add to MetaCart
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand's theorem which applies only to ##-formulas; but the original statement of Herbrand's theorem applied to arbitrary first-order formulas. We give a direct proof, based on cutelimination, of what is essentially Herbrand's original theorem. The "nocounterexample theorems" recently used in bounded and Peano arithmetic are immediate corollaries of this form of Herbrand's theorem.

