The following pages link to (Q4040890):
Displayed 17 items.
- Universal sets for pointsets properly on the <i>n</i><sup>th</sup> level of the projective hierarchy (Q4916557) (← links)
- Lattice initial segments of the hyperdegrees (Q5190191) (← links)
- Parsimony hierarchies for inductive inference (Q5311725) (← links)
- Π<sub>1</sub><sup>1</sup> relations and paths through (Q5311742) (← links)
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension (Q5322890) (← links)
- A Π¹₁-uniformization principle for reals (Q5322893) (← links)
- Cofinal maximal chains in the Turing degrees (Q5401377) (← links)
- Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond (Q5421031) (← links)
- Ranked structures and arithmetic transfinite recursion (Q5437595) (← links)
- Maximal chains in the Turing degrees (Q5444697) (← links)
- Index sets for classes of high rank structures (Q5444710) (← links)
- Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation (Q5477636) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- A gap 1 cardinal transfer theorem (Q5485486) (← links)
- Computability and Recursion (Q5689263) (← links)
- Up to equimorphism, hyperarithmetic is recursive (Q5718664) (← links)
- The strength of Mac Lane set theory (Q5946048) (← links)