The following pages link to (Q3329452):
Displayed 50 items.
- 2-minimality, jump classes and a note on natural definability (Q386644) (← links)
- Topological aspects of the Medvedev lattice (Q535142) (← links)
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- Degrees of asynchronously automaton transformations (Q647840) (← links)
- Strong polynomial-time reducibility (Q676314) (← links)
- Generic degrees are complemented (Q685063) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- There is no ordering on the classes in the generalized high/low hierarchies (Q818520) (← links)
- Structural theory of degrees of unsolvability: advances and open problems (Q904325) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- The jump operator on the \(\omega \)-enumeration degrees (Q1032630) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Upper bounds for the arithmetical degrees (Q1086229) (← links)
- Lattices of c-degrees (Q1095901) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- Diagonalizations over polynomial time computable sets (Q1107526) (← links)
- Initial segments of the degrees of constructibility (Q1109767) (← links)
- Graph isomorphism is in the low hierarchy (Q1116696) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- Probabilistic complexity classes and lowness (Q1263979) (← links)
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
- Cellular automata and intermediate degrees. (Q1401277) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759) (← links)
- Decidability of the AE-theory of the lattice of \({\Pi}_1^0\) classes (Q1745361) (← links)
- Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153) (← links)
- The complexity of reversible cellular automata (Q1884853) (← links)
- Undecidable fragments of elementary theories (Q1906521) (← links)
- Fragments of the theory of the enumeration degrees (Q2020402) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- TD implies \(\operatorname{CC}_{\mathbb{R}} \) (Q2237378) (← links)
- A survey of results on the d.c.e. and \(n\)-c.e. degrees (Q2263110) (← links)
- On computational complexity and honest polynomial degrees (Q2277252) (← links)
- The undecidability of the elementary theory of lattices of all equational theories of large signature (Q2311327) (← links)
- A reducibility related to being hyperimmune-free (Q2349101) (← links)
- Weak truth table degrees of structures (Q2354621) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- Constructive logic and the Medvedev lattice (Q2505132) (← links)
- Arithmetical Sacks forcing (Q2505505) (← links)
- 1-generic splittings of computably enumerable degrees (Q2576946) (← links)
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138) (← links)
- Extensions of embeddings below computably enumerable degrees (Q2838113) (← links)
- On the Computable Theory of Bounded Analytic Functions (Q2866157) (← links)
- Low Level Nondelegability Results: Domination and Recursive Enumeration (Q2869914) (← links)
- A Rigid Cone in the Truth-Table Degrees with Jump (Q2970975) (← links)
- Coding true arithmetic in the Medvedev and Muchnik degrees (Q3083139) (← links)
- A note on the join property (Q3116561) (← links)
- Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477) (← links)