No Access

GENERATING SETS FOR THE RECURSIVELY ENUMERABLE TURING DEGREES

Department of Mathematics and Computer Science, University of Heidelberg, D-69120 Heidelberg, Germany

Department of Mathematics, University of Wisconsin-Madison, Madison, WI 53706-1388, USA

Lempp was partially supported by NSF grant DMS-0140120 and a Mercator Guest Professorship of the Deutsche Forschungsgemeinschaft.

Search for more papers by this author

, and

Theodore A. Slaman

Department of Mathematics, University of California—Berkeley, Berkeley, CA 94720-3840, USA

Slaman was partially supported by the Alexander von Humboldt Foundation and by National Science Foundation Grant DMS-9988644.

Search for more papers by this author

https://doi.org/10.1142/9789812796554_0001Cited by:0 (Source: Crossref)

Abstract:

We give an example of a subset of the recursively enumerable Turing degrees which generates the recursively enumerable degrees using meet and join but does not generate them using join alone.

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

GENERATING SETS FOR THE RECURSIVELY ENUMERABLE TURING DEGREES

Recommended