Slow consistency

Annals of Pure and Applied Logic 164 (3):382-393 (2013)
  Copy   BIBTEX

Abstract

The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference . As a result, PA+Con is not the least theory whose strength is greater than that of PA. But still we can ask: is there a sense in which PA+Con is the least “natural” theory whose strength is greater than that of PA? In this paper we exhibit natural theories in strength strictly between PA and PA+Con by introducing a notion of slow consistency

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

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

Short Proofs for Slow Consistency.Anton Freund & Fedor Pakhomov - 2020 - Notre Dame Journal of Formal Logic 61 (1):31-49.
Models of weak theories of truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5):453-474.
Totality in applicative theories.Gerhard Jäger & Thomas Strahm - 1995 - Annals of Pure and Applied Logic 74 (2):105-120.
Theories Very Close to PA Where Kreisel's Conjecture Is False.Pavel Hrubeš - 2007 - Journal of Symbolic Logic 72 (1):123 - 137.
A note on the consistency operator.James Walsh - 2020 - Proceedings of the American Mathematical Society 148 (6):2645--2654.
Truth and feasible reducibility.Ali Enayat, Mateusz Łełyk & Bartosz Wcisło - 2020 - Journal of Symbolic Logic 85 (1):367-421.

Analytics

Added to PP
2013-12-12

Downloads
101 (#223,318)

6 months
24 (#135,495)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Michael Rathjen
University of Leeds

Citations of this work

Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
Short Proofs for Slow Consistency.Anton Freund & Fedor Pakhomov - 2020 - Notre Dame Journal of Formal Logic 61 (1):31-49.
Proof lengths for instances of the Paris–Harrington principle.Anton Freund - 2017 - Annals of Pure and Applied Logic 168 (7):1361-1382.
Transductions in arithmetic.Albert Visser - 2016 - Annals of Pure and Applied Logic 167 (3):211-234.

View all 9 citations / Add more citations

References found in this work

Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75-219.
Aspects of Incompleteness.Per Lindström - 1999 - Studia Logica 63 (3):438-439.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Relative Interpretations.Steven Orey - 1961 - Mathematical Logic Quarterly 7 (7-10):146-153.

View all 14 references / Add more references