Approximation representations for reals and their wtt‐degrees

Mathematical Logic Quarterly 50 (4-5):370-380 (2004)
  Copy   BIBTEX

Abstract

We study the approximation properties of computably enumerable reals. We deal with a natural notion of approximation representation and study their wtt-degrees. Also, we show that a single representation may correspond to a quite diverse variety of reals

Categories

Keywords

Reprint years

DOI

10.1002/malq.200310105

Links

PhilArchive



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

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

Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.
The approximation structure of a computably approximable real.George Barmpalias - 2003 - Journal of Symbolic Logic 68 (3):885-922.
Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.
Schnorr trivial reals: a construction. [REVIEW]Johanna N. Y. Franklin - 2008 - Archive for Mathematical Logic 46 (7-8):665-678.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
A transfinite hierarchy of reals.George Barmpalias - 2003 - Mathematical Logic Quarterly 49 (2):163-172.
Randomness and the linear degrees of computability.Andrew Em Lewis & George Barmpalias - 2007 - Annals of Pure and Applied Logic 145 (3):252-257.
Regular reals.Guohua Wu - 2005 - Mathematical Logic Quarterly 51 (2):111-119.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Complexity of reals in inner models of set theory.Boban Velickovic & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
Computably Enumerable Reals and Uniformly Presentable Ideals.S. A. Terwijn & R. Downey - 2002 - Mathematical Logic Quarterly 48 (S1):29-40.
Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.
Post's problem for supertasks has both positive and negative solutions.Joel David Hamkins & Andrew Lewis - 2002 - Archive for Mathematical Logic 41 (6):507-523.
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.

Analytics

Added to PP
2013-12-01

Downloads
30 (#548,002)

6 months
5 (#703,779)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.

Add more citations

References found in this work

Add more references