Publisher
American Mathematical Society (AMS)
Subject
Applied Mathematics,General Mathematics
Reference4 articles.
1. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication;Friedberg, Richard M.;J. Symbolic Logic,1958
2. Completeness, the recursion theorem, and effectively simple sets;Martin, Donald A.;Proc. Amer. Math. Soc.,1966
3. Creative sets;Myhill, John;Z. Math. Logik Grundlagen Math.,1955
4. Effectively simple sets;Smullyan, Raymond M.;Proc. Amer. Math. Soc.,1964
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Constructions in the Recursively Enumerable Degrees;Recursion Theory and Computational Complexity;2010
2. On Completeness of Pseudosimple Sets;J.UCS The Journal of Universal Computer Science;1996
3. On Some Complexity Characteristics of Immune Sets;Mathematical Logic Quarterly;1995
4. Bibliography;Studies in Logic and the Foundations of Mathematics;1992
5. Effectively hyperimmune sets and majorants;Mathematical Notes of the Academy of Sciences of the USSR;1985-08