Automorphism bases for degrees of unsolvability
From MaRDI portal
Publication:1164625
DOI10.1007/BF02761906zbMath0486.03025MaRDI QIDQ1164625
David B. Posner, Carl G. jun. Jockusch
Publication date: 1981
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
minimal degrees; comeager set; set of measure 1; sets of degrees of unsolvability generating the set of all degrees of unsolvability
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
On some filters and ideals of the Medvedev lattice, Sets of generator and automorphism bases for the enumeration degrees, Homomorphisms and quotients of degree structures, Some remarks on the algebraic structure of the Medvedev Lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On degrees of recursive unsolvability
- On automorphisms of the degrees that preserve jumps
- Initial segments of the degrees of unsolvability
- Solution to a Problem of Spector
- Degrees joining to 0′
- Definable degrees and automorphisms of 𝒟
- Reducibility orderings: Theories, definability and automorphisms
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- Measure and minimal degrees
- Determining Automorphisms of the Recursively Enumerable Sets
- Double jumps of minimal degrees
- Decidability of the “almost all” theory of degrees
- The degrees of bi‐immune sets
- Degrees in Which the Recursive Sets are Uniformly Recursive
