Short proofs for slow consistency

DOI10.1215/00294527-2019-0031zbMath1455.03078arXiv1712.03251OpenAlexW3104797474WikidataQ113751503 ScholiaQ113751503MaRDI QIDQ2176406

Fedor N. Pakhomov, Anton Freund

Publication date: 4 May 2020

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.03251

zbMATH Keywords

Peano arithmeticslow consistencyconsistency statementsproof sizefast-growing functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Recursive ordinals and ordinal notations (03F15) Complexity of proofs (03F20) Gödel numberings and issues of incompleteness (03F40)

Related Items

A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH, The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb

Cites Work

• Proof lengths for instances of the Paris-Harrington principle
• Rapidly growing Ramsey functions
• The computational complexity of logical theories
• Proof-theoretic analysis by iterated reflection
• Transfinite induction within Peano arithmetic
• Slow consistency
• Notation systems for infinitary derivations
• Slow reflection
• Arithmetization of metamathematics in a general setting
• Reflecting on incompleteness
• INCOMPLETENESS IN THE FINITE DOMAIN
• A Uniform Characterization of Σ₁-Reflection Over the Fragments of Peano Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item