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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

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

Computably Enumerable Reals and Uniformly Presentable Ideals.S. A. Terwijn & R. Downey - 2002 - Mathematical Logic Quarterly 48 (S1):29-40.
Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.
Degrees of d. c. e. reals.Rod Downey, Guohua Wu & Xizhong Zheng - 2004 - Mathematical Logic Quarterly 50 (4-5):345-350.
A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Weak Truth Table Degrees of Structures.David R. Belanger - 2015 - Notre Dame Journal of Formal Logic 56 (2):263-285.
Regular reals.Guohua Wu - 2005 - Mathematical Logic Quarterly 51 (2):111-119.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.

Analytics

Added to PP
2013-12-01

Downloads
37 (#601,180)

6 months
6 (#825,551)

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