Journal of Symbolic Logic

Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees

Paul Fischer

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

Article information

Source
J. Symbolic Logic, Volume 51, Issue 1 (1986), 117-129.

Dates
First available in Project Euclid: 6 July 2007

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

Mathematical Reviews number (MathSciNet)
MR830078

Zentralblatt MATH identifier
0587.03030

JSTOR
links.jstor.org

Citation

Fischer, Paul. Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. J. Symbolic Logic 51 (1986), no. 1, 117--129. https://projecteuclid.org/euclid.jsl/1183742032


Export citation