Pages that link to "Item:Q5677475"
From MaRDI portal
The following pages link to Ramsey's theorem and recursion theory (Q5677475):
Displaying 50 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Cohesive sets and rainbows (Q386619) (← links)
- Remembering Ernst Specker (1920--2011) (Q452476) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← 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)
- Computable Ramsey's theorem for pairs needs infinitely many \(\Pi ^0_2\) sets (Q512143) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 (Q1005921) (← links)
- Chains and antichains in partial orderings (Q1005926) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- A dual form of Ramsey's theorem (Q1057862) (← links)
- Ultrafilters and types on models of arithmetic (Q1058509) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- An infinite version of Arrow's theorem in the effective setting (Q1108914) (← links)
- The Galvin-Prikry theorem and set existence axioms (Q1117221) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- Upward closure and cohesive degrees (Q1394222) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← 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)
- \( \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)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- Infinite chains and antichains in computable partial orderings (Q2747728) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- Nonstandard models in recursion theory and reverse mathematics (Q2925331) (← links)
- Controlling iterated jumps of solutions to combinatorial problems (Q2964279) (← links)
- Herrmann’s Beautiful Theorem on Computable Partial Orderings (Q2970954) (← links)
- Effectiveness of Hindman’s Theorem for Bounded Sums (Q2970955) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
- The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- Partition Theorems and Computability Theory (Q3370615) (← links)
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 (Q3616431) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- Recursive Euler and Hamilton Paths (Q4091988) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- 2002 Annual Meeting of the Association for Symbolic Logic (Q4432543) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem (Q4596010) (← links)
