Author:
Csima Barbara F.,Kalimullin Iskander S.
Reference20 articles.
1. S. B. Cooper, Computability Theory (Chapman & Hall!CRC, 2004).
2. Almost everywhere domination;Dobrinen;J. Symbolic Logic,2004
3. R. G. Downey, On presentations ofalgebraic structures. In: Complexity, Logic, and Recursion Theory. Lect. Notes Pure Appl. Math. 187 (A. Sorbi, ed.), pp. 157-205 (Marcel Dekker, 1997).
4. Enumerations in computable structure theory;Goncharov;Annals of Pure and Applied Logic,2005
5. V. S. Harizanov, Pure computable model theory. In: Handbook ofRecursive Mathematics, Vol. 1. Stud. Logic Found. Math. 138, pp. 3-114 (North-Holland, 1998).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献