Notre Dame Journal of Formal Logic

Infima of recursively enumerable truth table degrees.

Peter A. Fejer and Richard A. Shore

Full-text: Open access

Article information

Source
Notre Dame J. Formal Logic, Volume 29, Number 3 (1988), 420-437.

Dates
First available in Project Euclid: 27 August 2004

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1093637938

Digital Object Identifier
doi:10.1305/ndjfl/1093637938

Mathematical Reviews number (MathSciNet)
MR953709

Zentralblatt MATH identifier
0663.03028

Subjects
Primary: 03D30: Other degrees and reducibilities
Secondary: 03D25: Recursively (computably) enumerable sets and degrees

Citation

Fejer, Peter A.; Shore, Richard A. Infima of recursively enumerable truth table degrees. Notre Dame J. Formal Logic 29 (1988), no. 3, 420--437. doi:10.1305/ndjfl/1093637938. https://projecteuclid.org/euclid.ndjfl/1093637938


Export citation