Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets

DOI10.1007/BF01980610zbMath0699.03024OpenAlexW2312615636MaRDI QIDQ912844

Yu. D. Shmidt

Publication date: 1989

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187460

zbMATH Keywords

automorphismshomogeneously hypersimple setslattice of r.e. setslattice of recursively enumerable extensionst-retraceability

Mathematics Subject Classification ID

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

Related Items (1)

Densely simple sets with retraceable complements

Cites Work

• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Splitting properties and jump classes
• \(r\)-maximal major subsets
• Recursively Enumerable Sets and Retracing Functions
• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• Retraceable Sets and Recursive Permutations
• Semirecursive Sets and Positive Reducibility

This page was built for publication: Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets