Upper Semilattices in Many-One Degrees

DOI10.1007/978-3-540-69407-6_53zbMath1142.03352OpenAlexW1594731031MaRDI QIDQ3507466

Sergei Podzorov

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_53

zbMATH Keywords

Arithmetical HierarchyComputably Enumerable SetDistributive Upper SemilatticeHyperimmune SetHypersimple SetImmune SetLachlan SemilatticeMany-One DegreeSimple Set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
• The upper semilattice of numerations of a finite set
• Classical recursion theory. Vol. II
• Recursively enumerable many-one degrees
• Numbered distributive semilattices
• The universal Lachlan semilattice without the greatest element
• Local structure of Rogers semilattices of Σn 0-computable numberings

This page was built for publication: Upper Semilattices in Many-One Degrees