The following pages link to (Q4040890):
Displayed 31 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)
- COMPUTABILITY IN UNCOUNTABLE BINARY TREES (Q5195058) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- On Some Semi-constructive Theories Related to Kripke–Platek Set Theory (Q5214791) (← links)
- Predicativity and Feferman (Q5214793) (← links)
- On the mathematical and foundational significance of the uncountable (Q5223120) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY (Q5251361) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions (Q5253934) (← links)
- INFINITARY TABLEAU FOR SEMANTIC TRUTH (Q5259720) (← links)
- Continuous higher randomness (Q5268401) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- Parallel Feedback Turing Computability (Q5283431) (← 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)
- (Q5376658) (← 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)
- Perfect Local Computability of Superatomic Boolean Algebras (Q5741358) (← links)
- The strength of Mac Lane set theory (Q5946048) (← links)