Pages that link to "Item:Q1913632"

The following pages link to On the strength of Ramsey's theorem (Q1913632):

Displaying 50 items.

• Cohesive sets and rainbows (Q386619) (← links)
• Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
• Genericity for Mathias forcing over general Turing ideals (Q503254) (← links)
• The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
• The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
• The thin set theorem for pairs implies DNR (Q894259) (← links)
• Ramsey's theorem for pairs and provably recursive functions (Q987936) (← links)
• The polarized Ramsey's theorem (Q1014283) (← links)
• \({\Pi^1_2}\)-comprehension and the property of Ramsey (Q1016505) (← links)
• An effective proof that open sets are Ramsey (Q1128188) (← links)
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
• Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← links)
• Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
• On the indecomposability of \(\omega^n\) (Q1762361) (← links)
• A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\) (Q1938403) (← links)
• \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models (Q2048618) (← links)
• Thin set versions of Hindman's theorem (Q2108578) (← links)
• In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
• On the strength of Ramsey's theorem for trees (Q2182273) (← links)
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
• Weaker cousins of Ramsey's theorem over a weak base theory (Q2231700) (← links)
• Using Ramsey's theorem once (Q2274133) (← links)
• Pigeons do not jump high (Q2313367) (← links)
• The strength of infinitary Ramseyan principles can be accessed by their densities (Q2358627) (← links)
• Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
• Coloring trees in reverse mathematics (Q2401697) (← links)
• Generics for computable Mathias forcing (Q2453068) (← links)
• Some logically weak Ramseyan theorems (Q2453567) (← links)
• Sets without subsets of higher many-one degree (Q2565991) (← links)
• On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
• Independence of Ramsey theorem variants using \(\varepsilon _0\) (Q2789881) (← links)
• Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom (Q2869903) (← links)
• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\) (Q2892679) (← links)
• Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
• The strength of Ramsey's theorem for coloring relatively large sets (Q2921021) (← links)
• Controlling iterated jumps of solutions to combinatorial problems (Q2964279) (← links)
• Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic (Q2968410) (← links)
• Some Questions in Computable Mathematics (Q2973717) (← links)
• STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES (Q2976339) (← links)
• THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343) (← links)
• THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
• Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
• The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
• The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
• Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics (Q3353014) (← links)
• Partition Theorems and Computability Theory (Q3370615) (← links)
• 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 (Q3616431) (← links)
• Ramsey's theorem and cone avoidance (Q3630579) (← links)
• The strength of the rainbow Ramsey Theorem (Q3655258) (← links)