Diagonals and -maximal sets

DOI10.2307/2275249MaRDI QIDQ4292592zbMATH OpenOpenAlexFDO

Authors

Publication date 24 November 1994

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2275249

zbMATH Keywords

diagonalhh-simplicitylattice of r.e. supersetsmaximalitysemihyperhypersimple

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Diagonals and semihyperhypersimple sets
• Some New Lattice Constructions in High R. E. Degrees
• Maximal theories

Cites work

• An easy priority-free proof of a theorem of Friedberg
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• scientific article; zbMATH DE number 3739514 (Why is no real title available?)
• On some games which are relevant to the theory of recursively enumerable sets
• The elementary theory of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets

Cited in

(12)

• Splitting theorems in recursion theory
• Some orbits for \({\mathcal E}\)
• Diagonalization in double frames
• Duality, non-standard elements, and dynamic properties of r.e. sets
• On splits of computably enumerable sets
• Diagonals and semihyperhypersimple sets
• scientific article; zbMATH DE number 1089080 (Why is no real title available?)
• On thick diagonals and their complements
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• Proximinality and diametrically maximal sets in \(C(K)\)
• Some recent research directions in the computably enumerable sets
• On the degrees of diagonal sets and the failure of the analogue of a theorem of Martin

This page was built for publication: Diagonals and -maximal sets

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