Comparing the degrees of enumerability and the closed Medvedev degrees

DOI10.1007/s00153-018-0648-xzbMath1445.03048arXiv1803.09485WikidataQ61307471 ScholiaQ61307471MaRDI QIDQ2312080

Paul Shafer, Andrea Sorbi

Publication date: 4 July 2019

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.09485

zbMATH Keywords

enumeration degrees; Medvedev degrees

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Cites Work

• Natural factors of the Medvedev lattice capturing IPC
• Topological aspects of the Medvedev lattice
• On some filters and ideals of the Medvedev lattice
• A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice
• Embedding Brouwer algebra in the Medvedev lattice
• A Survey of Mučnik and Medvedev Degrees
• Mass Problems and Randomness
• Some remarks on the algebraic structure of the Medvedev Lattice
• 1-genericity in the enumeration degrees
• Cototal enumeration degrees and their applications to effective mathematics
• A Note on Closed Degrees of Difficulty of the Medvedev Lattice
• On cototality and the skip operator in the enumeration degrees
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item