Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Kleene, S.: Recursive predicates and quantifiers. Trans. Amer. math. Soc.53, 41–73 (1943).
2. Mostowski, A.: On definable sets of positive integers. Fund. math.34, 81–112 (1947).
3. Post, E.: Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc.50, 284–316 (1944).
4. Kleene, S., andE. Post: The upper semi-lattice of degrees of recursive unsolvability. Ann. of Math. ser. 2,59, 379–407 (1954).
5. Turing, A.: On computable numbers with an application to the Entscheidungsproblem. Proc. London math. Soc., ser. 2,42, 230–265 (1936/37).
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Peano Arithmetic Models and Computability;Algebraic Computability and Enumeration Models;2016-02-25
2. Degrees of Unsolvability;Computational Logic;2014
3. There exists a maximal 3-C.E. enumeration degree;Israel Journal of Mathematics;2003-12
4. Index sets and presentations of complexity classes;Theoretical Computer Science;1996-07
5. Index sets related to prompt simplicity;Annals of Pure and Applied Logic;1989-05