Pages that link to "Item:Q2732267"

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

Displaying 50 items.

• Reverse mathematical bounds for the termination theorem (Q324248) (← links)
• On the strength of the finite intersection principle (Q375889) (← links)
• Cohesive sets and rainbows (Q386619) (← links)
• Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
• Subsets coded in elementary end extensions (Q403405) (← links)
• Primitive recursion and the chain antichain principle (Q435242) (← links)
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
• Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← 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 strength of the Grätzer-Schmidt theorem (Q506962) (← links)
• The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
• Computable Ramsey's theorem for pairs needs infinitely many \(\Pi ^0_2\) sets (Q512143) (← links)
• The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
• Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
• The thin set theorem for pairs implies DNR (Q894259) (← links)
• Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
• Ramsey's theorem for pairs and provably recursive functions (Q987936) (← links)
• The polarized Ramsey's theorem (Q1014283) (← 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)
• On the uniform computational content of computability theory (Q1694010) (← links)
• Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
• A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← links)
• On the indecomposability of \(\omega^n\) (Q1762361) (← links)
• On the strength of Ramsey's theorem (Q1913632) (← links)
• A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\) (Q1938403) (← links)
• New bounds on the strength of some restrictions of Hindman's theorem (Q2011655) (← links)
• \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models (Q2048618) (← 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)
• Pigeons do not jump high (Q2313367) (← links)
• The modal logic of reverse mathematics (Q2339962) (← links)
• The strength of infinitary Ramseyan principles can be accessed by their densities (Q2358627) (← links)
• More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
• The uniform content of partial and linear orders (Q2400498) (← links)
• Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) (Q2400502) (← links)
• Coloring trees in reverse mathematics (Q2401697) (← links)
• The reverse mathematics of non-decreasing subsequences (Q2402955) (← links)
• Generics for computable Mathias forcing (Q2453068) (← links)
• Some logically weak Ramseyan theorems (Q2453567) (← links)
• A \(\Delta_2^0\) set with no infinite low subset in either it or its complement (Q2758065) (← links)
• On uniform relationships between combinatorial problems (Q2796522) (← 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)