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

DOI10.1016/0168-0072(83)90031-3zbMath0538.03037MaRDI QIDQ793018

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 sets; major subset

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Diagonals and -maximal sets, Effectively dense Boolean algebras and their applications, THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES, The Complexity of Orbits of Computably Enumerable Sets, Computably enumerable sets and related issues, Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets, Automorphisms of the lattice of recursively enumerable sets: Orbits, Densely simple sets with retraceable complements, Splitting theorems in recursion theory, Orbits of computably enumerable sets: Low sets can avoid an upper cone, Atomless \(r\)-maximal sets, Duality, non-standard elements, and dynamic properties of r.e. sets, -MAXIMAL SETS, Definable incompleteness and Friedberg splittings, Variations on promptly simple sets

Cites Work

• Invariance of properties under automorphisms of the lattice of recursively enumerable sets
• \(r\)-maximal major subsets
• The elementary 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
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• On the Lattice of Recursively Enumerable Sets