Pages that link to "Item:Q2925331"
From MaRDI portal
The following pages link to Nonstandard models in recursion theory and reverse mathematics (Q2925331):
Displaying 9 items.
- Nonstandard arithmetic and recursive comprehension (Q636343) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Comparing the strength of diagonally nonrecursive functions in the absence of \(\Sigma_2^0\) induction (Q2795915) (← links)
- 1-Generic Degrees Bounding Minimal Degrees Revisited (Q2970978) (← links)
- Recursively saturated nonstandard models of arithmetic; addendum (Q3342574) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)