A Model–Theoretic Approach to Proof Theory

Cham, Switzerland: Springer Verlag (2019)
  Copy   BIBTEX

Abstract

This book presents a detailed treatment of ordinal combinatorics of large sets tailored for independence results. It uses model theoretic and combinatorial methods to obtain results in proof theory, such as incompleteness theorems or a description of the provably total functions of a theory. In the first chapter, the authors first discusses ordinal combinatorics of finite sets in the style of Ketonen and Solovay. This provides a background for an analysis of subsystems of Peano Arithmetic as well as for combinatorial independence results. Next, the volume examines a variety of proofs of Gödel's incompleteness theorems. The presented proofs differ strongly in nature. They show various aspects of incompleteness phenomena. In additon, coverage introduces some classical methods like the arithmetized completeness theorem, satisfaction predicates or partial satisfaction classes. It also applies them in many contexts. The fourth chapter defines the method of indicators for obtaining independence results. It shows what amount of transfinite induction we have in fragments of Peano arithmetic. Then, it uses combinatorics of large sets of the first chapter to show independence results. The last chapter considers nonstandard satisfaction classes. It presents some of the classical theorems related to them. In particular, it covers the results by S. Smith on definability in the language with a satisfaction class and on models without a satisfaction class. Overall, the book's content lies on the border between combinatorics, proof theory, and model theory of arithmetic. It offers readers a distinctive approach towards independence results by model-theoretic methods.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
An Introduction to Proof Theory: Normalization, Cut-Elimination, and Consistency Proofs.Paolo Mancosu, Sergio Galvan & Richard Zach - 2021 - Oxford: Oxford University Press. Edited by Sergio Galvan & Richard Zach.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Phase transitions for Gödel incompleteness.Andreas Weiermann - 2009 - Annals of Pure and Applied Logic 157 (2-3):281-296.
Bounded finite set theory.Laurence Kirby - 2021 - Mathematical Logic Quarterly 67 (2):149-163.

Analytics

Added to PP
2019-09-27

Downloads
12 (#1,115,280)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The Epistemic Lightness of Truth: Deflationism and its Logic.Cezary Cieśliński - 2017 - Cambridge, United Kingdom: Cambridge University Press.
New Constructions of Satisfaction Classes.Albert Visser & Ali Enayat - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer.
Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
Models of weak theories of truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.

View all 9 references / Add more references