Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
- 1 January 1987
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 33 (6) , 537-560
- https://doi.org/10.1002/malq.19870330608
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- On minimal pairs of enumeration degreesThe Journal of Symbolic Logic, 1985
- Jumps of quasi-minimal enumeration degreesThe Journal of Symbolic Logic, 1985
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are denseThe Journal of Symbolic Logic, 1984
- Partial degrees and the density problemThe Journal of Symbolic Logic, 1982
- Strong reducibilitiesBulletin of the American Mathematical Society, 1981
- RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONSMathematics of the USSR-Sbornik, 1979
- A survey of partial degreesThe Journal of Symbolic Logic, 1975
- A Minimal Partial Degree ≦0 Proceedings of the American Mathematical Society, 1973
- Initial Segments of Many-One DegreesCanadian Journal of Mathematics, 1970
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944