Journal of Symbolic Logic

Every $n$-Generic Degree is a Minimal Cover of an $n$-Generic Degree

Masahiro Kumabe

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Article information

Source
J. Symbolic Logic, Volume 58, Issue 1 (1993), 219-231.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183744186

Mathematical Reviews number (MathSciNet)
MR1217186

Zentralblatt MATH identifier
0848.03022

JSTOR
links.jstor.org

Citation

Kumabe, Masahiro. Every $n$-Generic Degree is a Minimal Cover of an $n$-Generic Degree. J. Symbolic Logic 58 (1993), no. 1, 219--231. https://projecteuclid.org/euclid.jsl/1183744186


Export citation