Unprovable combinatorial statements
From MaRDI portal
Publication:1201266
DOI10.1016/0012-365X(92)90686-AzbMath0763.03026MaRDI QIDQ1201266
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Kruskal's theoremunprovabilityfinite Ramsey theoremfast growing functionGoodstein sequencesHydra gameunprovable combinatorial statements in Peano arithmeticWainer's theorem
Trees (05C05) 2-person games (91A05) Undecidability and degrees of sets of sentences (03D35) Generalized Ramsey theory (05C55) Special sequences and polynomials (11B83) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rapidly growing Ramsey functions
- Accessible Independence Results for Peano Arithmetic
- An Unprovable Ramsey-Type Theorem
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- A classification of the ordinal recursive functions
- On the restricted ordinal theorem
This page was built for publication: Unprovable combinatorial statements