Definability in the Recursively Enumerable Degrees
From MaRDI portal
Publication:3128481
DOI10.2307/421171zbMath0874.03052OpenAlexW2000784135MaRDI QIDQ3128481
André Nies, Theodore A. Slaman, Richard A. Shore
Publication date: 5 November 1997
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/74423533fd75cc39f55afa659665d6eff419a90d
Related Items (6)
The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability ⋮ The relationship between local and global structure in the enumeration degrees ⋮ A Rigid Cone in the Truth-Table Degrees with Jump ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ On the definable ideal generated by nonbounding c.e. degrees ⋮ The existence of high nonbounding degrees in the difference hierarchy
Cites Work
- Working below a \(low_ 2\) recursively enumerable degree
- Undecidability and 1-types in the recursively enumerable degrees
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- Not every finite lattice is embeddable in the recursively enumerable degrees
- The recursively enumerable degrees are dense
- Interpolation and embedding in the recursively enumerable degrees
- On the degrees less than 0'
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- The undecidability of the recursively enumerable degrees
- On homogeneity and definability in the first-order theory of the Turing degrees
- The homogeneity conjecture
- A minimal pair of recursively enumerable degrees
- The impossibility of finding relative complements for recursively enumerable degrees
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Definability in the Recursively Enumerable Degrees
