An Introduction to Proof Theory: Normalization, Cut-Elimination, and Consistency Proofs
Oxford University Press, Aug 12, 2021 - Philosophy - 336 pages
An Introduction to Proof Theory provides an accessible introduction to the theory of proofs, with details of proofs worked out and examples and exercises to aid the reader's understanding. It also serves as a companion to reading the original pathbreaking articles by Gerhard Gentzen. The first half covers topics in structural proof theory, including the Gödel-Gentzen translation of classical into intuitionistic logic (and arithmetic), natural deduction and the normalization theorems (for both NJ and NK), the sequent calculus, including cut-elimination and mid-sequent theorems, and various applications of these results. The second half examines ordinal proof theory, specifically Gentzen's consistency proof for first-order Peano Arithmetic. The theory of ordinal notations and other elements of ordinal theory are developed from scratch, and no knowledge of set theory is presumed. The proof methods needed to establish proof-theoretic results, especially proof by induction, are introduced in stages throughout the text. Mancosu, Galvan, and Zach's introduction will provide a solid foundation for those looking to understand this central area of mathematical logic and the philosophy of mathematics.
What people are saying - Write a review
We haven't found any reviews in the usual places.
9 The consistency of arithmetic continued
A The Greek alphabet
Other editions - View all
An Introduction to Proof Theory: Normalization, Cut-Elimination, and ...
Limited preview - 2021
𝐴 allow already apply arithmetic assume atomic axiom 𝐵 basis calculus called cj inference classical clause complex conclusion condition consider consistency construction contains correct corresponding cut segment deduction defined Definition derivation discharged eigenvariable elements elimination empty end-formula end-part end-sequent ending example fact formula free variables Gentzen give given height hence holds inductive hypothesis instance introduced intuitionistic intuitionistic logic labelled least Lemma length logic lower major premise mathematics maximal means minor natural normal deduction Note obtain occur open assumptions operational ordinal notation ordinal notation assigned original path Problem proof proof theory Proposition prove quantifier rank reasoning reducible removed replace result right premise rule sequent simple step sub-deduction sub-formula sub-proof Suppose term theorem thread transformed true Vx B(x weakening well-ordering