Slow consistency
From MaRDI portal
Publication:1935874
The authors introduce the notion of slow consistency \(\mathrm{Con}^*(\mathrm{PA})\) of Peano arithmetic \(\mathrm{PA}\): ``For all \(x\), the theory consisting of the first \(f(x)\) non-logical axioms of \(\mathrm{PA}\) is consistent, where \(f\) is a certain slow-growing computable function. Then the authors prove that the strength of the theory \(\mathrm{PA} + \mathrm{Con}^*(\mathrm{PA})\) is strictly between the strength of the theory \(\mathrm{PA}\) and the strength of the theory \(\mathrm{PA} + \mathrm{Con}(\mathrm{PA})\).
Recommendations
Cited in
(18)- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- The scope of Feferman's semi-intuitionistic set theories and his second conjecture
- Short proofs for slow consistency
- Slow reflection
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
- Franco Montagna's work on provability logic and many-valued logic
- Promptness does not imply superlow cuppability
- scientific article; zbMATH DE number 3898883 (Why is no real title available?)
- scientific article; zbMATH DE number 4099294 (Why is no real title available?)
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions
- ON THE INEVITABILITY OF THE CONSISTENCY OPERATOR
- Current research on Gödel's incompleteness theorems
- A note on the consistency operator
- Proof lengths for instances of the Paris-Harrington principle
- Arbitrarily Slow Approach to Limiting Behavior
- On the hierarchy of natural theories
- General notions of consistency
- Transductions in arithmetic
This page was built for publication: Slow consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935874)