Combinatorial unprovability proofs and their model-theoretic counterparts
From MaRDI portal
Publication:2452679
DOI10.1215/00294527-2420654zbMath1301.03062OpenAlexW2051971362MaRDI QIDQ2452679
Publication date: 4 June 2014
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1398345782
First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Models of arithmetic and set theory (03C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Gödel incompleteness and finite combinatorics
- Sharp thresholds for hypergraph regressive Ramsey numbers
- On canonical Ramsey numbers for complete graphs versus paths
- The strength of infinitary Ramseyan principles can be accessed by their densities
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
- A classification of rapidly growing Ramsey functions
- An application of graphical enumeration to PA *
- The canonical Ramsey theorem and computability theory
- A Combinatorial Theorem
This page was built for publication: Combinatorial unprovability proofs and their model-theoretic counterparts