The undecidability of the recursively enumerable degrees

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35)

Cites Work

A recursively enumerable degree which will not split over all lesser ones

Cited In (36)

Undecidability and initial segments of the (r.e.) tt-degrees
Undecidability and 1-types in intervals of the computably enumerable degrees
Infima in the d.r.e. degrees
Undecidability and 1-types in the recursively enumerable degrees
The undecidability of the lattice of r. e. closed subsets of an effective topological space
The density of the nonbranching degrees
A survey of results on the d.c.e. and $n$-c.e. degrees
Splitting theorems in recursion theory
Embedding and coding below a 1-generic degree
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
On the theory of the PTIME degrees of the recursive sets
The last question on recursively enumerable $m$-degrees
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
Turing computability: structural theory
Working below a high recursively enumerable degree
Computational processes, observers and Turing incompleteness
Wtt-degrees and T-degrees of r.e. sets
On the existence of a strong minimal pair
Lattice nonembeddings and initial segments of the recursively enumerable degrees
Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
European Summer Meeting of the Association for Symbolic Logic
Undecidability of $L(F_{\infty})$ and other lattices of r.e. substructures
Intervals and sublattices of the r.e. weak truth table degrees. I: Density
CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
Incomparable prime ideals of recursively enumerable degrees
The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees
Degree Structures: Local and Global Investigations
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
1998–99 Annual Meeting of the Association for Symbolic Logic
Definability in the Recursively Enumerable Degrees
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
Interpreting true arithmetic in the theory of the r.e. truth table degrees
The $n$-r.e. degrees: undecidability and $\Sigma_1$ substructures
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

This page was built for publication: The undecidability of the recursively enumerable degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666835)