The following pages link to On a problem of Kleene’s (Q3276698):
Displaying 12 items.
- RANDOMNESS IN THE HIGHER SETTING (Q2795912) (← links)
- Sacks forcing sometimes needs help to produce a minimal upper bound (Q3486559) (← links)
- Polish Group Actions and the Vaught Conjecture (Q4286444) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- A complete classification of the Δ₂¹-functions (Q5551156) (← links)
- Some results in the effective descriptive set theory (Q5567856) (← links)
- Recursive Pseudo-Well-Orderings (Q5579489) (← links)
- A note on the hyperarithmetical hierarchy (Q5605217) (← links)
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory (Q5609369) (← links)
- Omitting types: application to recursion theory (Q5655353) (← links)
- The strength of Mac Lane set theory (Q5946048) (← links)
