Journal of Symbolic Logic

Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets

A. H. Lachlan

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

Article information

Source
J. Symbolic Logic, Volume 33, Issue 3 (1968), 431-443.

Dates
First available in Project Euclid: 6 July 2007

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

Mathematical Reviews number (MathSciNet)
MR236016

Zentralblatt MATH identifier
0197.00502

JSTOR
links.jstor.org

Citation

Lachlan, A. H. Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets. J. Symbolic Logic 33 (1968), no. 3, 431--443. https://projecteuclid.org/euclid.jsl/1183736430


Export citation