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: 91,386

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

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.
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.
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.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
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.
Image Content.Mohan Matthen - 2014 - In Berit Brogaard (ed.), Does Perception Have Content? Oxford University Press. pp. 265-290.
On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
Codable sets and orbits of computably enumerable sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
Differences of Computably Enumerable Sets.A. Nies & S. Lempp - 2000 - Mathematical Logic Quarterly 46 (4):555-562.
Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
A superhigh diamond in the c.e. tt-degrees.Douglas Cenzer, Johanna Ny Franklin, Jiang Liu & Guohua Wu - 2011 - Archive for Mathematical Logic 50 (1-2):33-44.

Analytics

Added to PP
2013-12-31

Downloads
333 (#58,315)

6 months
103 (#37,792)

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