Enumeration reducibility and partial degrees
Open Access
- 28 February 1971
- journal article
- Published by Elsevier in Annals of Mathematical Logic
- Vol. 2 (4) , 419-439
- https://doi.org/10.1016/0003-4843(71)90003-9
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968
- Some applications of the notions of forcing and generic setsFundamenta Mathematicae, 1964
- A minimal degree less than 0’Bulletin of the American Mathematical Society, 1961
- Degrees of unsolvability associated with classes of formalized theoriesThe Journal of Symbolic Logic, 1957
- On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1956
- On axiomatizability within a systemThe Journal of Symbolic Logic, 1953