Булевы иерархии разбиений над редуцируемой базой
В. Л. Селиванов

Эта публикация цитируется в следующих статьяx:

1. Vladimir Podolskii, Victor Selivanov, “Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions”, Electron. Proc. Theor. Comput. Sci., 407 (2024), 186  
2. RAPHAËL CARROY, LUCA MOTTO ROS, SALVATORE SCAMPERTI, “A CLASSIFICATION OF THE WADGE HIERARCHIES ON ZERO-DIMENSIONAL POLISH SPACES”, J. symb. log., 2023, 1  
3. Selivanov V., “Q-Wadge Degrees as Free Structures”, Computability, 9:3-4 (2020), 327–341          
4. Hertling P., Selivanov V., “Complexity Issues For Preorders on Finite Labeled Forests”, Logic, Computation, Hierarchies, Ontos Mathematical Logic, 4, eds. Brattka V., Diener H., Spreen D., Walter de Gruyter Gmbh, 2014, 165–189    
5. Zhukov A.V., “Some Notes on the Universality of Three-Orders on Finite Labeled Posets”, Logic, Computation, Hierarchies, Ontos Mathematical Logic, 4, eds. Brattka V., Diener H., Spreen D., Walter de Gruyter Gmbh, 2014, 393–409    
6. Selivanov V., “Fine Hierarchies via Priestley Duality”, Ann. Pure Appl. Log., 163:8, SI (2012), 1075–1107            
7. Kwuida L., Lehtonen E., “On the Homomorphism Order of Labeled Posets”, Order, 28:2 (2011), 251–265          
8. Victor Selivanov, Lecture Notes in Computer Science, 6735, Models of Computation in Context, 2011, 260  
9. Peter Hertling, Victor Selivanov, Lecture Notes in Computer Science, 6735, Models of Computation in Context, 2011, 112  
10. Selivanov V.L., “On the Wadge reducibility of $k$-partitions”, J. Log. Algebr. Program., 79:1 (2010), 92–102          
11. А. В. Жуков, О. В. Кудинов, В. Л. Селиванов, “Определимость операций замыкания в $h$-предпорядке размеченных лесов”, Алгебра и логика, 49:2 (2010), 181–194      ; A. V. Zhukov, O. V. Kudinov, V. L. Selivanov, “Definability of closure operations in the $h$-quasiorder of labeled forests”, Algebra and Logic, 49:2 (2010), 120–129    
12. Kudinov O.V., Selivanov V.L., Zhukov A.V., “Undecidability in Weihrauch Degrees”, Programs, Proofs, Processes, Lecture Notes in Computer Science, 6158, 2010, 256–265            
13. Kudinov O.V., Selivanov V.L., Zhukov A.V., “Definability in the $h$-quasiorder of labeled forests”, Ann. Pure Appl. Logic, 159:3 (2009), 318–332            
14. Selivanov V.L., “Undecidability of some structures related to computation theory”, J. Logic Comput., 19:1 (2009), 177–197            
15. Kudinov O.V., Selivanov V.L., “A Gandy Theorem for Abstract Structures and Applications to First-Order Definability”, Mathematical Theory and Computational Practice, Lecture Notes in Computer Science, 5635, 2009, 290–299          
16. Selivanov V.L., “Fine hierarchies and m-reducibilities in theoretical computer science”, Theoret. Comput. Sci., 405:1-2 (2008), 116–163            
17. Kosub S., Wagner K.W., “The boolean hierarchy of NP-partitions”, Inform. and Comput., 206:5 (2008), 538–568          
18. Lehtonen E., “Labeled posets are universal”, European J. Combin., 29:2 (2008), 493–506            
19. Victor Selivanov, “On the Difference Hierarchy in Countably Based T0-Spaces”, Electronic Notes in Theoretical Computer Science, 221 (2008), 257  
20. Victor Selivanov, “On the Wadge Reducibility of k-Partitions”, Electronic Notes in Theoretical Computer Science, 202 (2008), 59  
21. В. Л. Селиванов, “Фактор-алгебра размеченных лесов по отношению $h$-эквивалентности”, Алгебра и логика, 46:2 (2007), 217–243        ; V. L. Selivanov, “The quotient algebra of labeled forests modulo $h$-equivalence”, Algebra and Logic, 46:2 (2007), 120–133      
22. З. Г. Хисамиев, “Дистрибутивные решётки нумераций”, Алгебра и логика, 46:1 (2007), 83–102      ; Z. G. Khisamiev, “Distributive lattices of numberings”, Algebra and Logic, 46:1 (2007), 50–61    
23. Kudinov O.V., Selivanov V.L., “Undecidability in the homomorphic quasiorder of finite labelled forests”, J. Logic Comput., 17:6 (2007), 1135–1151            
24. Selivanov V.L., “Hierarchies of $\Delta^0_2$-measurable $k$-partitions”, MLQ Math. Log. Q., 53:4-5 (2007), 446–461          
25. Kudinov O.V., Selivanov V.L., “Definability in the homomorphic quasiorder of finite labeled forests”, Computation and Logic in the Real World, Proceedings, Lecture Notes in Computer Science, 4497, 2007, 436–445          
26. Selivanov V.L., “A useful undecidable theory”, Computation and Logic in the Real World, Proceedings, Lecture Notes in Computer Science, 4497, 2007, 685–694          
27. Lehtonen E., “Descending chains and antichains of the unary, linear, and monotone subfunction relations”, Order, 23:2-3 (2006), 129–142          
28. Selivanov V.L., “Towards a descriptive set theory for domain-like structures”, Theoret. Comput. Sci., 365:3 (2006), 258–282            
29. Kuske D., “Theories of orders on the set of words”, Theor. Inform. Appl., 40:1 (2006), 53–74          
30. Kudinov O.V., Selivanov V.L., “Undecidability in the homomorphic quasiorder of finite labeled forests”, Logical approaches to computational barriers, Second conference on computability in Europe, CiE 2006 (Swansea, UK, June 30–July 5, 2006), Proceedings, Lecture Notes in Comput. Sci., 3988, Springer, Berlin, 2006, 289–296        
31. В. Л. Селиванов, “Вариации на тему сводимости Вэджа”, Матем. тр., 8:1 (2005), 135–175      ; V. L. Selivanov, “Variations on the Wadge Reducibility”, Siberian Adv. Math., 15:3 (2005), 44–80
32. Victor L. Selivanov, “Variations on Wadge Reducibility Extended Abstract”, Electronic Notes in Theoretical Computer Science, 120 (2005), 159