Comparing the degrees of enumerability and the closed Medvedev degrees

&
Archive for Mathematical Logic 58 (5-6):527-542 (2019)
  Copy   BIBTEX

Abstract

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.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-018-0648-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.
Topological aspects of the Medvedev lattice.Andrew Em Lewis, Richard A. Shore & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):319-340.
Characterizing the Join-Irreducible Medvedev Degrees.Paul Shafer - 2011 - Notre Dame Journal of Formal Logic 52 (1):21-38.
A Note on Closed Degrees of Difficulty of the Medvedev Lattice.Caterina Bianchini & Andrea Sorbi - 1996 - Mathematical Logic Quarterly 42 (1):127-133.
Elementary Differences between the (2p)-C. E. and the (2p + 1)-C. E. Enumeration Degrees.I. Sh Kalimullin - 2007 - Journal of Symbolic Logic 72 (1):277 - 284.
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (6):1201-1241.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
The Medvedev Lattice of Degrees of Difficulty.Andrea Sorbi - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--289.
Relative enumerability in the difference hierarchy.Marat M. Arslanov, Geoffrey L. Laforte & Theodore A. Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
Relative Enumerability in the Difference Hierarchy.Marat Arslanov, Geoffrey Laforte & Theodore Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
Bi-isolation in the d.c.e. degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409-420.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Density results in the Δ 2 0 e-degrees.Marat M. Arslanov, Iskander Sh Kalimullin & Andrea Sorbi - 2001 - Archive for Mathematical Logic 40 (8):597-614.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.

Analytics

Added to PP
2018-09-29

Downloads
17 (#872,959)

6 months
6 (#530,265)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.
A survey of Mučnik and Medvedev degrees.Peter G. Hinman - 2012 - Bulletin of Symbolic Logic 18 (2):161-229.

View all 12 references / Add more references