Recursively enumerable sets and degrees
Open Access
- 1 January 1978
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 84 (6) , 1149-1181
- https://doi.org/10.1090/s0002-9904-1978-14552-2
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 127 references indexed in Scilit:
- d-simple sets, small sets, and degree classesPacific Journal of Mathematics, 1980
- Banach–Mazur games, comeager sets and degrees of unsolvabilityMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Post's problem and his hypersimple setThe Journal of Symbolic Logic, 1973
- The class of recursively enumerable subsets of a recursively enumerable setPacific Journal of Mathematics, 1973
- Degrees of members of Π10classesPacific Journal of Mathematics, 1972
- DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATESMathematics of the USSR-Izvestiya, 1971
- Computing degrees of unsolvabilityMathematische Annalen, 1959
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- On the combination of subalgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1933
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931