Every n-generic degree is a minimal cover of an n-generic degree

Journal of Symbolic Logic 58 (1):219-231 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
A 1-generic degree which Bounds a minimal degree.Masahiro Kumabe - 1990 - Journal of Symbolic Logic 55 (2):733-743.
The degrees below a 1-generic degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Almost weakly 2-generic sets.Stephen A. Fenner - 1994 - Journal of Symbolic Logic 59 (3):868-887.
Minimal groups in separably closed fields.E. Bouscaren & F. Delon - 2002 - Journal of Symbolic Logic 67 (1):239-259.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.
A 1-generic degree with a strong minimal cover.Masahiro Kumabe - 2000 - Journal of Symbolic Logic 65 (3):1395-1442.

Analytics

Added to PP
2009-01-28

Downloads
209 (#95,492)

6 months
2 (#1,185,463)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Trend of Logic and Foundation of Mathematics in Japan in 1991 to 1996.Yuzuru Kakuda, Kanji Namba & Nobuyoshi Motohashi - 1997 - Annals of the Japan Association for Philosophy of Science 9 (2):95-110.

Add more citations

References found in this work

No references found.

Add more references