Pages that link to "Item:Q436224"
From MaRDI portal
The following pages link to \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224):
Displayed 15 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Program extraction for 2-random reals (Q365682) (← links)
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
- The thin set theorem for pairs implies DNR (Q894259) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- Weaker cousins of Ramsey's theorem over a weak base theory (Q2231700) (← links)
- COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION (Q2795915) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331) (← links)
- Weakly Represented Families in Reverse Mathematics (Q2970957) (← links)
- On the strength of Ramsey's theorem without Σ<sub>1</sub>‐induction (Q4915224) (← links)
- From Bolzano‐Weierstraß to Arzelà‐Ascoli (Q5419209) (← links)
