- 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 degrees below a 1-generic degree $
Journal of Symbolic Logic 51 (3):770 - 777 (1986)
Abstract
It is shown that the nonrecursive predecessors of a 1-generic degree $ are all 1-generic. As a corollary, it is shown that the 1-generic degrees are not densely orderedOther Versions
No versions found
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
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.
A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
A note on the enumeration degrees of 1-generic sets.Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent & Andrea Sorbi - 2016 - Archive for Mathematical Logic 55 (3):405-414.
Density-1-bounding and quasiminimality in the generic degrees.Peter Cholak & Gregory Igusa - 2017 - Journal of Symbolic Logic 82 (3):931-957.
Enumeration 1-Genericity in the Local Enumeration Degrees. [REVIEW]Liliana Badillo, Charles M. Harris & Mariya I. Soskova - 2018 - Notre Dame Journal of Formal Logic 59 (4):461-489.
Domination, forcing, array nonrecursiveness and relative recursive enumerability.Mingzhong Cai & Richard A. Shore - 2012 - Journal of Symbolic Logic 77 (1):33-48.
Dynamic notions of genericity and array noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Schnorr triviality and genericity.Johanna N. Y. Franklin - 2010 - Journal of Symbolic Logic 75 (1):191-207.
Analytics
Added to PP
2009-01-28
Downloads
199 (#202,861)
6 months
47 (#177,117)
2009-01-28
Downloads
199 (#202,861)
6 months
47 (#177,117)
Historical graph of downloads
Citations of this work
Dynamic notions of genericity and array noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.
Natural factors of the Muchnik lattice capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.
Maximal Towers and Ultrafilter Bases in Computability Theory.Steffen Lempp, Joseph S. Miller, André Nies & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (3):1170-1190.
Generic degrees are complemented.Masahiro Kumabe - 1993 - Annals of Pure and Applied Logic 59 (3):257-272.
Embedding and Coding below a 1-Generic Degree.Noam Greenberg & Antonio Montalbán - 2003 - Notre Dame Journal of Formal Logic 44 (4):200-216.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
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