E-Book, Englisch, 0 Seiten
Reihe: Perspectives in Logic
Schwichtenberg / Wainer Proofs and Computations
Erscheinungsjahr 2012
ISBN: 978-1-139-21057-7
Verlag: Cambridge University Press
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
E-Book, Englisch, 0 Seiten
Reihe: Perspectives in Logic
ISBN: 978-1-139-21057-7
Verlag: Cambridge University Press
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)
Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to ?11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and ?11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Preface
Preliminaries
Part I. Basic Proof Theory and Computability: 1. Logic
2. Recursion theory
3. Godel's theorems
Part II. Provable Recursion in Classical Systems: 4. The provably recursive functions of arithmetic
5. Accessible recursive functions, ID




