Degrees of recursively enumerable sets which have no maximal supersets
From MaRDI portal
Publication:5593823
DOI10.2307/2270328zbMath0197.00502OpenAlexW2150311525MaRDI QIDQ5593823
Publication date: 1968
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270328
Related Items
A class of hypersimple incomplete sets, An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets, Degree theoretic definitions of the low2 recursively enumerable sets, Computably enumerable sets that are automorphic to low sets, Extending and interpreting Post's programme, Splitting properties and jump classes, The Lattice of Computably Enumerable Vector Spaces, Automorphisms of the lattice of recursively enumerable sets: Orbits, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, Codable sets and orbits of computably enumerable sets, Computably enumerable sets and related issues, Pointwise decomposable sets, \(r\)-maximal major subsets, Turing computability: structural theory, Some lowness properties and computational complexity sequences, α-Degrees of maximal α-r.e. sets, Recursively enumerable sets and degrees, Computational complexity, speedable and levelable sets, Degree invariance in the Π10classes, Definable properties of the computably enumerable sets, Automorphisms of the lattice of recursively enumerable sets, ON SUPERSETS OF NON-LOW SETS, Definable Encodings in the Computably Enumerable Sets, Determining Automorphisms of the Recursively Enumerable Sets, Hyperhypersimple supersets in admissible recursion theory
Cites Work
