Pages that link to "Item:Q3666835"
From MaRDI portal
The following pages link to The undecidability of the recursively enumerable degrees (Q3666835):
Displaying 36 items.
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Infima in the d.r.e. degrees (Q685080) (← links)
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
- On the theory of the PTIME degrees of the recursive sets (Q751819) (← links)
- Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358) (← links)
- The density of the nonbranching degrees (Q1055403) (← links)
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures (Q1083446) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density (Q1092896) (← links)
- The undecidability of the lattice of r. e. closed subsets of an effective topological space (Q1098841) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- The last question on recursively enumerable \(m\)-degrees (Q1908450) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- A survey of results on the d.c.e. and \(n\)-c.e. degrees (Q2263110) (← links)
- THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (Q2909622) (← links)
- Definability in the Recursively Enumerable Degrees (Q3128481) (← links)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- Wtt-degrees and T-degrees of r.e. sets (Q3676135) (← links)
- The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility (Q4032885) (← links)
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072) (← links)
- Working below a high recursively enumerable degree (Q4276023) (← links)
- Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 (Q4302362) (← links)
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES (Q4408481) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- The undecidability of the Π<sub>4</sub>-theory for the r.e. wtt and Turing degrees (Q4876314) (← links)
- 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
- Undecidability and initial segments of the (r.e.) tt-degrees (Q5202181) (← links)
- THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES (Q5485749) (← links)
- On the existence of a strong minimal pair (Q5501923) (← links)
- CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES (Q5858920) (← links)
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)