Comparing the Medvedev and Turing degrees of Π01 classes

DOI10.1017/S0960129513000303zbMath1362.03036OpenAlexW2117506494MaRDI QIDQ5740675

Takayuki Kihara

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129513000303

Mathematics Subject Classification ID

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

Cites Work

• Upper bounds on ideals in the computably enumerable Turing degrees
• Mass problems associated with effectively closed sets
• Density of the Medvedev lattice of \(\Pi^0_1\) classes
• Hyperimmunity in \(2^{\mathbb N}\)
• Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
• $K$-triviality in computable metric spaces
• Mass Problems and Randomness
• Non-branching degrees in the Medvedev lattice of Π₁⁰ classes
• K-Triviality of Closed Sets and Continuous Functions
• A splitting theorem for the Medvedev and Muchnik lattices
• Class groups of integral group rings

This page was built for publication: Comparing the Medvedev and Turing degrees of Π⁰₁ classes