Some Properties of Recursively Inseparable Sets
- 1 January 1970
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 16 (2) , 187-200
- https://doi.org/10.1002/malq.19700160208
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Turing-machines and the EntscheidungsproblemMathematische Annalen, 1962
- Theory of Formal Systems. (AM-47)Published by Walter de Gruyter GmbH ,1961
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- 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
- Quasicreative setsProceedings of the American Mathematical Society, 1957
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944