The weak truth table degrees of recursively enumerable sets
- 30 September 1975
- journal article
- Published by Elsevier in Annals of Mathematical Logic
- Vol. 8 (4) , 429-448
- https://doi.org/10.1016/0003-4843(75)90007-8
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Deficiency sets and bounded information reducibilitiesTransactions of the American Mathematical Society, 1974
- A completely mitotic nonrecursive r.e. degreeTransactions of the American Mathematical Society, 1973
- A Dichotomy of the Recursively Enumerable SetsMathematical Logic Quarterly, 1968
- The impossibility of finding relative complements for recursively enumerable degreesThe Journal of Symbolic Logic, 1966
- A minimal pair of recursively enumerable degreesThe Journal of Symbolic Logic, 1966
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- Reducibility and Completeness for Sets of IntegersMathematical Logic Quarterly, 1959