The following pages link to The degree of a \(\Sigma_ n\) cut (Q749530):
Displaying 11 items.
- Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory (Q334991) (← links)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction (Q466117) (← links)
- The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator (Q1368581) (← links)
- In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
- Weaker cousins of Ramsey's theorem over a weak base theory (Q2231700) (← links)
- 1-Generic Degrees Bounding Minimal Degrees Revisited (Q2970978) (← links)
- Σ<sub>2</sub> Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator (Q4227867) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
