scispace - formally typeset
Book ChapterDOI

Herbrand's Theorem and Proof-Theory

Reads0
Chats0
TLDR
In this paper, the authors discuss the importance of Herbrand's theorem for the proof theorist of 1981, 50 years after her death, and present their posterity in recent work.
Abstract
Publisher Summary Herbrand's “Theoreme Fondamental,” one of the milestones of mathematical logic, is one of the few basic results of proof theory, only challenged by Gentzen's Hauptsatz. The chapter discusses the importance of Herbrand's theorem for the proof theorist of 1981, 50 years after Herbrand's death. Direct uses or extensions of Herbrand's result are discussed, but also general ideas in proof theory that are still alive and can be—at least partly—ascribed to Herbrand, The chapter analyzes the main ideas in Herbrand's theorem—as they appear 50 years later—and presents their posterity in recent work, not connected with Herbrand's theorem. One of the major defects of Herbrand's theorem is the bad behavior with respect to implication. A regular notion with respect to this problem is obtained by Godel's functional interpretation, which can be thought as an unwinding of the no-counter example interpretation by means of functionals of finite type.

read more

Citations
More filters
Posted Content

A quantitative ergodic theory proof of Szemer\'edi's theorem

Terence Tao
- 13 May 2004 - 
TL;DR: A quantitative, self-contained version of this ergodic theory proof is presented, which is ``elementary'' in the sense that it does not require the axiom of choice, the use of infinite sets or measures, or theUse of the Fourier transform or inverse theorems from additive combinatorics.
Journal ArticleDOI

A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma

TL;DR: A correspondence principle is introduced that allows one to extract an infinite random graph or hyper graph from a sequence of increasingly large deterministic graphs or hypergraphs and gives new proofs of several corollaries of the hypergraph removal lemma, such as Szemerédi's Theorem on arithmetic progressions.
Book ChapterDOI

The Löwenheim-Skolem Theorem, Theories of Quantification, and Proof Theory

TL;DR: In this paper, the authors explore the role of Herbrand's work in developing the discipline of proof theory and formulate a theory about the impact which questions raised by Herbrand, about the meaning of satisfiability in Hilbert's axiomatic method, had on the proliferation of quantification theories presented as alternatives to Hilbert's system.
References
More filters
Book

Introduction to logic

Journal ArticleDOI

Über eine bisher noch nicht benützte erweiterung Des finiten standpunktes

TL;DR: In this paper, Bernays has pointed out that, in order to prove the consistency of classical number theory, it is necessary to extend Hilbert's finitary stand-point by admitting certain abstract concepts in addition to the combinatorial concepts referring to symbols.
Book ChapterDOI

Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions

TL;DR: In this article, a proof theoretical analysis of the intuitionistic theory of generalized inductive definitions iterated an arbitrary finite number of times is presented, where the axioms expressing the principles of definition and proof by generalized induction are reformulated as rules of inference similar to those introduced by Gentzen in his system of natural deduction for first order predicate logic.
Journal ArticleDOI

Rapidly growing Ramsey functions