Comparing the degrees of enumerability and the closed Medvedev degrees

We compare the degrees of enumerability and the closed Medvedev degrees and find that many situations occur. There are nonzero closed degrees that do not bound nonzero degrees of enumerability, there are nonzero degrees of enumerability that do not bound nonzero closed degrees, and there are degrees that are nontrivially both degrees of enumerability and closed degrees. We also show that the compact degrees of enumerability exactly correspond to the cototal enumeration degrees.

[1]  S. Cooper,et al.  Computability, enumerability, unsolvability: directions in recursion theory , 1996 .

[2]  Mariya Ivanova Soskova,et al.  On cototality and the skip operator in the enumeration degrees , 2019, Transactions of the American Mathematical Society.

[3]  Andrea Sorbi,et al.  A Note an Closed Degrees of Difficulty of the Medvedev Lattice , 1996, Math. Log. Q..

[4]  Andrea Sorbi,et al.  On some filters and ideals of the Medvedev lattice , 1990, Arch. Math. Log..

[5]  R. Schindler.  Descriptive Set Theory , 2014 .

[6]  Kate Copestake,et al.  1-genericity in the enumeration degrees , 1988, Journal of Symbolic Logic.

[7]  Andrea Sorbi,et al.  Embedding Brouwer Algebras in the Medvedev Lattice , 1991, Notre Dame J. Formal Log..

[8]  Rutger Kuyper,et al.  Natural factors of the Medvedev lattice capturing IPC , 2013, Arch. Math. Log..

[9]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[10]  Andrea Sorbi.  Some Remarks on the Algebraic Structure of the Medvedev Lattice , 1990, J. Symb. Log..

[11]  E Z Dyment.  On Some Properties of the Medvedev Lattice , 1976 .

[12]  Andrea Sorbi,et al.  Topological aspects of the Medvedev lattice , 2011, Arch. Math. Log..

[13]  H. Rogers,et al.  Some Problems of Definability in Recursive Function Theory , 1967 .

[14]  H. Priestley,et al.  Distributive Lattices , 2004 .

[15]  Ethan McCarthy.  Cototal enumeration degrees and their applications to effective mathematics , 2017 .

[16]  Peter G. Hinman,et al.  A survey of Mučnik and Medvedev degrees , 2010, Bull. Symb. Log..

[17]  Andrea Sorbi,et al.  The Medvedev lattice of degrees of difficulty , 1996 .

[18]  Y. Moschovakis.  Descriptive Set Theory , 1980 .

[19]  E. Z. Skvortsova.  A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice , 1988 .

[20]  Stephen G. Simpson.  Mass problems and randomness , 2005, Bull. Symb. Log..

[21]  R. Soare,et al.  Π⁰₁ classes and degrees of theories , 1972 .