Relatively computably enumerable reals

Archive for Mathematical Logic 50 (3-4):361-365 (2011)
  Copy   BIBTEX

Abstract

A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X \not\leq_T Y}$$\end{document}. A real X is relatively simple and above if there is a real Y

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Relative Randomness and Real Closed Fields.Alexander Raichev - 2005 - Journal of Symbolic Logic 70 (1):319 - 330.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
A δ02 set with barely σ02 degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.

Analytics

Added to PP
2013-10-27

Downloads
39 (#410,943)

6 months
5 (#648,432)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Relative definability of n-generics.Wei Wang - 2018 - Journal of Symbolic Logic 83 (4):1345-1362.

Add more citations

References found in this work

Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Arithmetical Reducibilities I.Alan L. Selman - 1971 - Mathematical Logic Quarterly 17 (1):335-350.
Arithmetical Reducibilities I.Alan L. Selman - 1971 - Mathematical Logic Quarterly 17 (1):335-350.
Bounding non- GL ₂ and R.E.A.Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu - 2009 - Journal of Symbolic Logic 74 (3):989-1000.

Add more references