Duke Mathematical Journal

The elementary theory of recursively enumerable sets

A. H. Lachlan

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Article information

Source
Duke Math. J., Volume 35, Number 1 (1968), 123-146.

Dates
First available in Project Euclid: 21 February 2004

Permanent link to this document
https://projecteuclid.org/euclid.dmj/1077377463

Digital Object Identifier
doi:10.1215/S0012-7094-68-03513-8

Mathematical Reviews number (MathSciNet)
MR0227008

Zentralblatt MATH identifier
0281.02043

Subjects
Primary: 02.54

Citation

Lachlan, A. H. The elementary theory of recursively enumerable sets. Duke Math. J. 35 (1968), no. 1, 123--146. doi:10.1215/S0012-7094-68-03513-8. https://projecteuclid.org/euclid.dmj/1077377463


Export citation