Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton, FL (2004)
2. Csima, B.F.: Applications of Computability Theory to Prime Models and Differential Geometry, Ph.D. thesis, The University of Chicago (2003)
3. Csima, B.F., Shore, R.A.: The Settling-Time Reducibility Ordering. Journal of Symbolic Logic 71(4), 1394–1410 (2006)
4. Csima, B.F., Soare, R.I.: Computability Results Used in Differential Geometry, Journal of Symbolic Logic (To appear)
5. Martin, D.A.: Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundlagen Math. 12, 295–310 (1966)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ON A QUESTION OF CSIMA ON COMPUTATION-TIME DOMINATION;Proceedings of the 12th Asian Logic Conference;2013-05-28