Pages that link to "Item:Q3426570"
From MaRDI portal
The following pages link to Combinatorial principles weaker than Ramsey's Theorem for pairs (Q3426570):
Displayed 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)
- 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)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- The thin set theorem for pairs implies DNR (Q894259) (← links)
- Constant regions in models of arithmetic (Q894260) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- On the jumps of the degrees below a recursively enumerable degree (Q1704085) (← 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)
- In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← 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)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- The reverse mathematics of non-decreasing subsequences (Q2402955) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- Rainbow Ramsey Theorem for Triples is Strictly Weaker than the Arithmetical Comprehension Axiom (Q2869903) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Herrmann’s Beautiful Theorem on Computable Partial Orderings (Q2970954) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- The cohesive principle and the Bolzano-Weierstraß principle (Q3008059) (← links)
- Necessary use of induction in a reversal (Q3011120) (← links)
- Linear extensions of partial orders and reverse mathematics (Q3144869) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Computable Reductions and Reverse Mathematics (Q3188256) (← links)
- Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
- Iterative Forcing and Hyperimmunity in Reverse Mathematics (Q3195708) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Bounding non-GL<sub>2</sub> and R.E.A. (Q3399188) (← links)
- 2007 Annual Meeting of the Association for Symbolic Logic (Q3533520) (← links)
- On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics (Q3550582) (← links)
- On a question of Andreas Weiermann (Q3619872) (← links)
- Stability and posets (Q3630588) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- The strength of the rainbow Ramsey Theorem (Q3655258) (← links)