Author:
Harizanov Valentina S.,Jockusch Carl G.,Knight Julia F.
Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. Jockusch C.G. Jr.: Ramsey’s theorem and recursion theory. J. Symb. Logic 37, 268–280 (1972)
2. Herrmann E.: Infinite chains and antichains in computable partial orderings. J. Symb. Logic 66, 923–934 (2001)
3. Binns S., Kjos-Hanssen B., Lerman M., Schmerl J.H., Solomon R.: Self-embeddings of computable trees. Notre Dame J. Formal Logic 49, 1–37 (2008)
4. Rogers H. Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
5. Ash C.J., Knight J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献