Minimal degrees recursive in 1-generic degrees

&
Annals of Pure and Applied Logic 48 (3):215-225 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(90)90020-3

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: 104,804

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 degrees and minimal degrees in higher recursion theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.
A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
BAILEY, C. and DOWNEY, R., Tabular degrees in (Y-recursion theory BALDWIN, JT and SHELAH, S., The primal framework II: Smoothness BERARDUCCI, A. and INTRIGILA, B., Combinatorial. [REVIEW]Sb Cooper, L. Harrington & Ah Lachlan - 1992 - Annals of Pure and Applied Logic 55:321.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.
Generic degrees are complemented.Masahiro Kumabe - 1993 - Annals of Pure and Applied Logic 59 (3):257-272.
Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
The members of thin and minimal Π 1 0 classes, their ranks and Turing degrees.Rodney G. Downey, Guohua Wu & Yue Yang - 2015 - Annals of Pure and Applied Logic 166 (7-8):755-766.

Analytics

Added to PP
2014-01-16

Downloads
60 (#388,424)

6 months
19 (#160,720)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A 1-generic degree with a strong minimal cover.Masahiro Kumabe - 2000 - Journal of Symbolic Logic 65 (3):1395-1442.
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.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.

View all 9 citations / Add more citations

References found in this work

∑1-density And Turing Degrees.C. Chong - 1987 - Mathematical Logic Quarterly 33 (2):141-145.
∑1‐Density and Turing Degrees.C. T. Chong - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):141-145.
Diagonalization in degree constructions.D. Posner & R. Epstein - 1978 - Journal of Symbolic Logic 43 (2):280-283.

Add more references