Author:
Kudinov Oleg V.,Selivanov Victor L.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Barwise, J.: Admissible Sets and Structures. Springer, Berlin (1975)
2. Ershov, Y.L.: Definability and Computability. Plenum, New-York (1996)
3. Hertling, P.: Topologische Komplexitätsgrade von Funktionen mit endlichem Bild. Informatik-Berichte 152, 34 pages, Fernuniversität Hagen (1993)
4. Lecture Notes in Computer Science;O.V. Kudinov,2007
5. Kudinov, O.V., Selivanov, V.L.: Undecidability in the homomorphic quasiorder of finite labeled forests. Journal of Logic and Computation 17, 1135–1151 (2007)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Descriptive complexity of qcb0-spaces;Theoretical Computer Science;2023-02
2. Complexity in Young's lattice;Annals of Pure and Applied Logic;2022-04
3. DEFINING RECURSIVE PREDICATES IN GRAPH ORDERS;LOG METH COMPUT SCI;2018
4. Wadge-like reducibilities on arbitrary quasi-Polish spaces;Mathematical Structures in Computer Science;2014-11-10
5. TOTAL REPRESENTATIONS;LOG METH COMPUT SCI;2013