The degrees below a 1-generic degree $

Journal of Symbolic Logic 51 (3):770 - 777 (1986)
  Copy   BIBTEX

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 ordered

Categories

Keywords

Reprint years

DOI

10.2307/2274030

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,506

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

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.
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.
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
80 (#282,697)

6 months
11 (#332,048)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Natural factors of the Muchnik lattice capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.
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.
Dynamic notions of genericity and array noncomputability.Benjamin Schaeffer - 1998 - Annals of Pure and Applied Logic 95 (1-3):37-69.

View all 9 citations / Add more citations

References found in this work

No references found.

Add more references