- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The ibT degrees of computably enumerable sets are not dense
Annals of Pure and Applied Logic 141 (1):51-60 (2006)
Abstract
We show that the identity bounded Turing degrees of computably enumerable sets are not denseAuthor's Profile
Other Versions
No versions found
My notes
Similar books and articles
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.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Upper bounds on ideals in the computably enumerable Turing degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.
Completely mitotic c.e. degrees and non-jump inversion.Evan J. Griffiths - 2005 - Annals of Pure and Applied Logic 132 (2-3):181-207.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
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.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Analytics
Added to PP
2013-12-31
Downloads
478 (#59,619)
6 months
77 (#79,836)
2013-12-31
Downloads
478 (#59,619)
6 months
77 (#79,836)
Historical graph of downloads
Author's Profile
Citations of this work
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Π 1 0 classes, L R degrees and Turing degrees.George Barmpalias, Andrew E. M. Lewis & Frank Stephan - 2008 - Annals of Pure and Applied Logic 156 (1):21-38.
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.
Randomness and the linear degrees of computability.Andrew Em Lewis & George Barmpalias - 2007 - Annals of Pure and Applied Logic 145 (3):252-257.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
References found in this work
The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
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.
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.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-fcc9b7db9-2cdf9 uwo