A note on the consistency operator

Proceedings of the American Mathematical Society 148 (6):2645--2654 (2020)
  Copy   BIBTEX

Abstract

It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement to the effect that the consistency operator is the weakest natural way to uniformly extend axiomatic theories.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

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

Evitable iterates of the consistency operator.James Walsh - 2023 - Computability 12 (1):59--69.
Reflection ranks and ordinal analysis.Fedor Pakhomov & James Walsh - 2021 - Journal of Symbolic Logic 86 (4):1350-1384.
Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.
Short Proofs for Slow Consistency.Anton Freund & Fedor Pakhomov - 2020 - Notre Dame Journal of Formal Logic 61 (1):31-49.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
Consistency and the theory of truth.Richard Heck - 2015 - Review of Symbolic Logic 8 (3):424-466.
Set Theory and Logic.Robert Roth Stoll - 2012 - San Francisco and London: Courier Corporation.

Analytics

Added to PP
2022-09-12

Downloads
12 (#1,369,278)

6 months
7 (#706,906)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

James Walsh
New York University

Citations of this work

Evitable iterates of the consistency operator.James Walsh - 2023 - Computability 12 (1):59--69.

Add more citations

References found in this work

No references found.

Add more references