Pages that link to "Item:Q3190948"
From MaRDI portal
The following pages link to The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948):
Displayed 37 items.
- Inductive inference and reverse mathematics (Q324252) (← 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 inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← 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)
- Reverse mathematics and colorings of hypergraphs (Q2312088) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION (Q2795915) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← 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)
- On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059) (← links)
- Computable Reductions and Reverse Mathematics (Q3188256) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM (Q4600456) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← links)
- An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Cohesive avoidance and strong reductions (Q5496327) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)