degrees of computably enumerable sets are not dense - PhilPapers" /> degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic 141 (1):51-60. "> } Degrees of Computably Enumerable Sets Are Not Dense}, volume = {141}, year = {2006} } ">

The http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007205001429-si1. gif"/> degrees of computably enumerable sets are not dense [Book Review]

&
Annals of Pure and Applied Logic 141 (1):51-60 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2005.10.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

Completeness and partial soundness results for intersection and union typing for http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007210000515-si1. gif"/>. [REVIEW]Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.
Ordinal analysis of non-monotone http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007208000924-si1. gif"/>-definable inductive definitions. [REVIEW]Wolfram Pohlers - 2008 - Annals of Pure and Applied Logic 156 (1):160-169.
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.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1-2):51-60.
George Barmpalias, Andrew E. M. Lewis and Keng Meng NG. The importance of Π 0 1 classes in effective randomness. The Journal of Symbolic Logic, vol. 75 (2010), pp. 387–400. - George Barmpalias, Andrew E. M. Lewis and Frank Stephan. Π 0 1 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, vol. 156 (2008), pp. 21–38. - Antonin Kučera. Measure, Π 0 1 classes and complete extensions of PA. Recursion Theory Week (Oberwofach, 1984). Lecture Notes in Mathematics, vol. 1141. Springer, Berlin, 1985, pp. 245–259. - Frank Stephan. Martin-Löf randomness and PA complete sets. Logic Colloquium '02. Lecture Notes in Logic, vol. 27, Association for Symbolic Logic, La Jolla, CA, 2006, pp. 342–348. [REVIEW]Douglas Cenzer - 2012 - Bulletin of Symbolic Logic 18 (3):409-412.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
Complementing cappable degrees in the difference hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
Undecidability and 1-types in intervals of the computably enumerable degrees.Klaus Ambos-Spies, Denis R. Hirschfeldt & Richard A. Shore - 2000 - Annals of Pure and Applied Logic 106 (1-3):1-47.
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.

Analytics

Added to PP
2013-12-31

Downloads
371 (#57,262)

6 months
79 (#72,254)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrew Lewis
Graduate Theological Union

Citations of this work

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.
Kolmogorov complexity and computably enumerable sets.George Barmpalias & Angsheng Li - 2013 - Annals of Pure and Applied Logic 164 (12):1187-1200.
Maximal pairs of c.e. reals in the computably Lipschitz degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.

Add more citations

References found in this work

Computability theory and differential geometry.Robert I. Soare - 2004 - Bulletin of Symbolic Logic 10 (4):457-486.
There Is No SW-Complete C.E. Real.Liang Yu & Decheng Ding - 2004 - Journal of Symbolic Logic 69 (4):1163 - 1170.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
Strong reducibility on hypersimple sets.T. G. McLaughlin - 1965 - Notre Dame Journal of Formal Logic 6 (3):229-234.

Add more references