The intervals of the lattice of recursively enumerable sets determined by major subsets

DOI10.1016/0168-0072(83)90031-3MaRDI QIDQ793018zbMATH OpenOpenAlexFDO

Authors Wolfgang Maass, Michael Stob

Publication date 1983

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(83)90031-3

zbMATH Keywords

lattice of recursively enumerable setsmajor subset

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3924766
• scientific article; zbMATH DE number 3950506
• Publication:4863243
• Definable structures in the lattice of recursively enumerable sets
• Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras

Cites work

• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Invariance of properties under automorphisms of the lattice of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets
• The elementary theory of recursively enumerable sets
• r-maximal major subsets

Cited in

(21)

• Definable structures in the lattice of recursively enumerable sets
• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• scientific article; zbMATH DE number 841087 (Why is no real title available?)
• \(\mathcal{D}\)-maximal sets
• Splitting theorems in recursion theory
• On densely simple sets with retraceable complements
• Atomless \(r\)-maximal sets
• Computably enumerable sets and related issues
• Diagonals and -maximal sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Effectively dense Boolean algebras and their applications
• Definable incompleteness and Friedberg splittings
• scientific article; zbMATH DE number 3950506 (Why is no real title available?)
• The Complexity of Orbits of Computably Enumerable Sets
• The \(\forall \exists \) theory of Peano \(\Sigma_1\) sentences
• Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets
• scientific article; zbMATH DE number 3924766 (Why is no real title available?)
• Duality, non-standard elements, and dynamic properties of r.e. sets
• Densely simple sets with retraceable complements
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Variations on promptly simple sets

This page was built for publication: The intervals of the lattice of recursively enumerable sets determined by major subsets

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