- 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
There Are No Maximal Low D.C.E. Degrees
Notre Dame Journal of Formal Logic 45 (3):147-159 (2004)
Abstract
We prove that there is no maximal low d.c.e degreeAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.
Maximal Chains in the Turing Degrees.C. T. Chong & Liang Yu - 2007 - Journal of Symbolic Logic 72 (4):1219 - 1227.
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
An almost deep degree.Peter Cholak, Marcia Groszek & Theodore Slaman - 2001 - Journal of Symbolic Logic 66 (2):881-901.
Maximal R.e. Equivalence relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
1-reducibility inside an m-degree with maximal set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
Degrees of recursively enumerable sets which have no maximal supersets.A. H. Lachlan - 1968 - Journal of Symbolic Logic 33 (3):431-443.
Analytics
Added to PP
2010-08-24
Downloads
50 (#310,395)
6 months
3 (#1,023,809)
2010-08-24
Downloads
50 (#310,395)
6 months
3 (#1,023,809)
Historical graph of downloads
Author's Profile
Citations of this work
References found in this work
The d.r.e. degrees are not dense.S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
Relative enumerability in the difference hierarchy.Marat M. Arslanov, Geoffrey L. Laforte & Theodore A. Slaman - 1998 - Journal of Symbolic Logic 63 (2):411-420.
A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
There is No Low Maximal D.C.E. Degree.Marat Arslanov, S. Barry Cooper & Angsheng Li - 2000 - Mathematical Logic Quarterly 46 (3):409-416.
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-7c76586df8-pp8v9 uwo