A Note on Closed Degrees of Difficulty of the Medvedev Lattice

DOI10.1002/malq.19960420111zbMath0845.03020OpenAlexW2019129040MaRDI QIDQ4868246

Andrea Sorbi, Caterina Bianchini

Publication date: 6 March 1996

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

Full work available at URL: https://doi.org/10.1002/malq.19960420111

zbMATH Keywords

filtermass problemsMedvedev latticedegree of difficultyBaire topologyrecursive operator

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, Topological aspects of the Medvedev lattice, Coding true arithmetic in the Medvedev and Muchnik degrees, Comparing the degrees of enumerability and the closed Medvedev degrees

Cites Work

• Unnamed Item