The following pages link to (Q4040890):
Displayed 50 items.
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Computing maximal chains (Q453200) (← links)
- On the classification of recursive languages (Q598240) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- Atomic models higher up (Q952493) (← links)
- Remarks on two problems by M. Laczkovich on functions with Borel measurable differences (Q955175) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Ordinal machines and admissible recursion theory (Q1032634) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- The irregular and non-hyperregular \(\alpha\)-r.e. degrees (Q1245218) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268) (← links)
- Turing determinacy and the continuum hypothesis (Q1824617) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) (← links)
- On the commutativity of jumps (Q2710604) (← 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)
- 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)
- 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)
- Forcing in Proof Theory (Q4678943) (← links)