An Unprovable Ramsey-Type Theorem
From MaRDI portal
Recommendations
Cites work
- A classification of the ordinal recursive functions
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Accessible Independence Results for Peano Arithmetic
- scientific article; zbMATH DE number 4031661 (Why is no real title available?)
- scientific article; zbMATH DE number 4033742 (Why is no real title available?)
- scientific article; zbMATH DE number 4193657 (Why is no real title available?)
- Linearity and Unprovability of Set Union Problem Strategies
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- On Gödel incompleteness and finite combinatorics
- On the restricted ordinal theorem
- Rapidly growing Ramsey functions
Cited in
(24)- Logic, combinatorics and independence results. Abstracts from the mini-workshop held November 25 -- December 2, 2006.
- Some bounds for the Ramsey-Paris-Harrington numbers
- Unprovable combinatorial statements
- Bootstrapping the primitive recursive functions by only 27 colors
- A Ramsey theorem in Boyer-Moore logic
- Upper bounds on positional Paris-Harrington games
- More on lower bounds for partitioning \(\alpha\)-large sets
- Combinatorial unprovability proofs and their model-theoretic counterparts
- Independence of Ramsey theorem variants using \(\varepsilon _0\)
- Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
- The modified Ramsey theorem is not a Gödel sentence
- Phase transition results for three Ramsey-like theorems
- scientific article; zbMATH DE number 4134034 (Why is no real title available?)
- A combinatorial bound for a restricted form of the termination theorem
- Partitioning 𝛼–large sets: Some lower bounds
- Relationship between Kanamori-McAloon principle and Paris-Harrington theorem
- Unprovability, phase transitions and the Riemann zeta-function
- Brief introduction to unprovability
- scientific article; zbMATH DE number 3946114 (Why is no real title available?)
- A classification of rapidly growing Ramsey functions
- Proof lengths for instances of the Paris-Harrington principle
- On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
- A WALK WITH GOODSTEIN
- Reductions of well-ordering principles to combinatorial theorems
This page was built for publication: An Unprovable Ramsey-Type Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031465)
