Reducibility and Completeness for Sets of Integers
Authors:
- 1 January 1959
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 5 (7-13) , 117-125
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The Present Theory of Turing Machine ComputabilityJournal of the Society for Industrial and Applied Mathematics, 1959
- Quasicreative setsProceedings of the American Mathematical Society, 1957
- Quasicreative SetsProceedings of the American Mathematical Society, 1957
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957
- On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1956
- On completely recursively enumerable classes and their key arraysThe Journal of Symbolic Logic, 1956
- Productive setsTransactions of the American Mathematical Society, 1955
- Productive SetsTransactions of the American Mathematical Society, 1955
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944