The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
From MaRDI portal
Publication:4913812
DOI10.1090/S0002-9947-2012-05600-5zbMath1268.03050MaRDI QIDQ4913812
Publication date: 16 April 2013
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Related Items (4)
Computably enumerable sets that are automorphic to low sets ⋮ Definable relations in Turing degree structures ⋮ ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS ⋮ Turing computability: structural theory
Cites Work
- Unnamed Item
- Definable properties of the computably enumerable sets
- On some games which are relevant to the theory of recursively enumerable sets
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Definability in the Recursively Enumerable Degrees
- Degrees of classes of RE sets
- Automorphisms of the lattice of recursively enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Degrees of recursively enumerable sets which have no maximal supersets
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Recursive Enumerability and the Jump Operator
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
