Proof Theory: The First Step into Impredicativity
โ Scribed by Wolfram Pohlers (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2009
- Tongue
- English
- Leaves
- 379
- Series
- Universitext
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
This book verifies with compelling evidence the authorโs intent to "write a book on proof theory that needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof theory as far as possible, the book starts at an elementary level and displays the connections between infinitary proof theory and generalized recursion theory, especially the theory of inductive definitions. As a "warm up" Gentzen's classical analysis of pure number theory is presented in a more modern terminology, followed by an explanation and proof of the famous result of Feferman and Schรผtte on the limits of predicativity. The author also provides an introduction to ordinal arithmetic, introduces the Veblen hierarchy and employs these functions to design an ordinal notation system for the ordinals below Epsilon 0 and Gamma 0, while emphasizing the first step into impredicativity, that is, the first step beyond Gamma 0. This is first done by an analysis of the theory of non-iterated inductive definitions using Buchholzโs improvement of local predicativity, followed by Weiermann's observation that Buchholzโs method can also be used for predicative theories to characterize their provably recursive functions. A second example presents an ordinal analysis of the theory of $/Pi_2$ reflection, a subsystem of set theory that is proof-theoretically equivalent to Kripke-Platek set.
The book is pitched at undergraduate/graduate level, and thus addressed to students of mathematical logic interested in the basics of proof theory. It can be used for introductory as well as more advanced courses in proof theory.
An earlier version of this book was published in 1989 as volume 1407 of the "Lecture Notes in Mathematics" (ISBN 978-3-540-51842-6).
โฆ Table of Contents
Front Matter....Pages i-xiii
Historical Background....Pages 1-8
Primitive Recursive Functions and Relations....Pages 9-15
Ordinals....Pages 17-42
Pure Logic....Pages 43-68
Truth Complexity for โ 1 1 -Sentences....Pages 69-82
Inductive Definitions....Pages 83-104
The Ordinal Analysis for PA ....Pages 105-130
Autonomous Ordinals and the Limits of Predicativity....Pages 131-156
Ordinal Analysis of the Theory for Inductive Definitions....Pages 157-206
Provably Recursive Functions of NT ....Pages 207-235
Ordinal Analysis for KripkeโPlatek Set Theory with Infinity....Pages 237-295
Predicativity Revisited....Pages 297-332
Nonmonotone Inductive Definitions....Pages 333-351
Epilogue....Pages 353-356
Back Matter....Pages 357-374
โฆ Subjects
Mathematical Logic and Foundations
๐ SIMILAR VOLUMES
<P>This book verifies with compelling evidence the authorโs inclination to "write a book on proof theory which needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof as far as possible, the book starts at an elementary level and displays the connections between infin
This book verifies with compelling evidence the authorโs inclination to ''write a book on proof theory which needs no previous knowledge of proof theory''. Avoiding the cryptic terminology of proof as far as possible, the book starts at an elementary level and displays the connections between infini
This book verifies with compelling evidence the authorโs inclination to "write a book on proof theory which needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof as far as possible, the book starts at an elementary level and displays the connections between infinita
<P>This book verifies with compelling evidence the authorะฒะโขs inclination to "write a book on proof theory which needs no previous knowledge of proof theory". Avoiding the cryptic terminology of proof as far as possible, the book starts at an elementary level and displays the connections between inf