Pages that link to "Item:Q2652167"
From MaRDI portal
The following pages link to The upper semi-lattice of degrees of recursive unsolvability (Q2652167):
Displayed 50 items.
- On the theory of the PTIME degrees of the recursive sets (Q751819) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Goodness in the enumeration and singleton degrees (Q992037) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- The density of the nonbranching degrees (Q1055403) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- The minimum degree of recursively representable choice functions (Q1072546) (← links)
- Not every finite lattice is embeddable in the recursively enumerable degrees (Q1142206) (← links)
- Countable admissible ordinals and hyperdegrees (Q1142207) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Lattice nonembeddings and intervals of the recursively enumerable degrees (Q1802183) (← links)
- A semantical proof of De Jongh's theorem (Q1812961) (← links)
- Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153) (← links)
- Priority constructions (Q1923576) (← links)
- The minimum of two regressive isols (Q2626678) (← links)
- Infima of d.r.e. degrees (Q2655142) (← links)
- Complementation in the Turing degrees (Q3032238) (← links)
- Forcing and reducibilities (Q3041177) (← links)
- Decomposition and infima in the computably enumerable degrees (Q3160553) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Recursive well-orderings (Q3227571) (← links)
- A criterion for completeness of degrees of unsolvability (Q3243262) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- (Q3256314) (← links)
- Measure-theoretic construction of incomparable hyperdegrees (Q3256319) (← links)
- On a Subrecursive Hierarchy and Primitive Recursive Degrees (Q3257773) (← links)
- Gödel numberings of partial recursive functions (Q3260572) (← links)
- Constructive Versions of Ordinal Number Classes (Q3281066) (← links)
- Degrees of models (Q3290719) (← links)
- Independence Results on the Global Structure of the Turing Degrees (Q3309826) (← links)
- Discontinuities of provably correct operators on the provably recursive real numbers (Q3337468) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- Decidability and Invariant Classes for Degree Structures (Q3487331) (← links)
- The jump is definable in the structure of the degrees of unsolvability (Q3491536) (← links)
- DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP (Q3521600) (← links)
- Infima of d.r.e. Degrees (Q3576065) (← links)
- Mass Problems and Measure-Theoretic Regularity (Q3655266) (← links)
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers (Q3691653) (← links)
- On the embedding of <i>α</i>-recursive presentable lattices into the <i>α</i>-recursive degrees below <b>0′</b> (Q3731593) (← links)
- The degrees below a 1-generic degree < <b>0</b>′ (Q3770518) (← links)
- An Uncountable Set of Incomparable Degrees (Q3846375) (← links)
- Definable degrees and automorphisms of 𝒟 (Q3898485) (← links)
- Jump embeddings in the Turing degrees (Q3984430) (← links)
- A Theorem on Intermediate Reducibilities (Q4047539) (← links)
- A survey of partial degrees (Q4079599) (← links)
- The decision problem for recursively enumerable degrees (Q4106188) (← links)
- Banach–Mazur games, comeager sets and degrees of unsolvability (Q4111548) (← links)