The following pages link to (Q4040890):
Displayed 50 items.
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) (← links)
- Determinacy and monotone inductive definitions (Q2631880) (← links)
- On the commutativity of jumps (Q2710604) (← links)
- RANDOMNESS IN THE HIGHER SETTING (Q2795912) (← links)
- THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS (Q2795919) (← links)
- Descriptive inner model theory (Q2837761) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS (Q2925331) (← links)
- SOME OBSERVATIONS ON TRUTH HIERARCHIES (Q2940864) (← links)
- Mass problems and density (Q2951897) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- ON THE NON-ENUMERABILITY OF <i>L</i> (Q2976338) (← links)
- Weak systems of determinacy and arithmetical quasi-inductive definitions (Q3011112) (← links)
- On the orbits of computably enumerable sets (Q3058264) (← links)
- A Computational Approach to an Alternative Working Environment for the Constructible Universe (Q3091437) (← links)
- On a positive set theory with inequality (Q3096082) (← links)
- On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers (Q3117786) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- A New Proof of Friedman's Conjecture (Q3174641) (← links)
- On notions of computability-theoretic reduction between Π21 principles (Q3186057) (← links)
- FRAGMENTS OF FREGE’S<i>GRUNDGESETZE</i>AND GÖDEL’S CONSTRUCTIBLE UNIVERSE (Q3188332) (← links)
- The metamathematics of Stable Ramsey’s Theorem for Pairs (Q3190948) (← links)
- $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
- Turing Computations On Ordinals (Q3370613) (← links)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Measure theory aspects of locally countable orderings (Q3410682) (← links)
- Randomness and Computability: Open Questions (Q3412462) (← links)
- AXIOM <i>I</i><sub>0</sub> AND HIGHER DEGREE THEORY (Q3450811) (← links)
- Reals <i>n</i>-generic relative to some perfect tree (Q3503745) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Mass Problems and Measure-Theoretic Regularity (Q3655266) (← links)
- A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no <i>α</i>-recursive functional on the class of <i>α</i>-recursive functions (Q3924188) (← links)
- <i>α</i>-degrees of <i>α</i>-theories (Q4091916) (← links)
- On generalized computational complexity (Q4163200) (← links)
- The effective content of surreal algebra (Q4212906) (← links)
- Anti-admissible sets (Q4262559) (← links)
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 (Q4432544) (← links)
- Regular enumerations (Q4451721) (← links)
- Infinite time Turing machines (Q4508248) (← links)
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES (Q4579805) (← links)
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
- HIGHER RANDOMNESS AND GENERICITY (Q4599263) (← links)
- ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES (Q4600467) (← links)
- BASIS THEOREMS FOR -SETS (Q4628687) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Forcing in Proof Theory (Q4678943) (← links)