Proof lengths for instances of the Paris-Harrington principle

DOI10.1016/j.apal.2017.01.004zbMath1380.03069DBLPjournals/apal/Freund17arXiv1601.08185OpenAlexW2253714458WikidataQ57948752 ScholiaQ57948752MaRDI QIDQ526964

Anton Freund

Publication date: 15 May 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmeticfinite Ramsey theoremfast growing hierarchyParis-Harrington principleproof lengthslow consistency

Mathematics Subject Classification ID

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

Related Items (6)

Bounds for a nonlinear ergodic theorem for Banach spaces ⋮ Unnamed Item ⋮ Slow reflection ⋮ Short proofs for slow consistency ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streamlined subrecursive degree theory
• Harvey Friedman's research on the foundations of mathematics
• On the number of steps in proofs
• Rapidly growing Ramsey functions
• Proof-theoretic analysis by iterated reflection
• Transfinite induction within Peano arithmetic
• Slow consistency
• Notation systems for infinitary derivations
• An Unprovable Ramsey-Type Theorem
• The Ackermann functions are not optimal, but by how much?
• A classification of the ordinal recursive functions
• Eine Klassifikation der ε₀‐Rekursiven Funktionen
• On the interpretation of non-finitist proofs–Part II

This page was built for publication: Proof lengths for instances of the Paris-Harrington principle