A Note on Closed Degrees of Difficulty of the Medvedev Lattice

DOI10.1002/MALQ.19960420111MaRDI QIDQ4868246zbMATH OpenOpenAlexFDO

Authors Caterina Bianchini, Andrea Sorbi

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

Baire topologydegree of difficultyfiltermass problemsMedvedev latticerecursive operator

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 841094
• On the structure of the Medvedev lattice
• The Medvedev lattice of computably closed sets
• Some remarks on the algebraic structure of the Medvedev Lattice
• Comparing the degrees of enumerability and the closed Medvedev degrees
• scientific article; zbMATH DE number 1643917
• Non-branching degrees in the Medvedev lattice of Π₁⁰ classes
• Some Quotient Lattices of the Medvedev Lattice
• Classifying the branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes

Cited in

(8)

• Density of the lattice of mth degrees of conditional problems
• Comparing the degrees of enumerability and the closed Medvedev degrees
• Coding true arithmetic in the Medvedev and Muchnik degrees
• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• scientific article; zbMATH DE number 841094 (Why is no real title available?)
• Topological aspects of the Medvedev lattice
• Characterizing the join-irreducible Medvedev degrees
• On some filters and ideals of the Medvedev lattice

This page was built for publication: A Note on Closed Degrees of Difficulty of the Medvedev Lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868246)