Publication of V.L. Selivanov

1. (.PDF) Recursiveness of omega-operations. Math. Logic Quaterly, 40, N 2 (1994), --206.

2. (.PDF) Two refinements of the polynomial hierarchy. In: Proc. of 11-th Int. Symposium on Theor. Aspects of Computer Science STACS-94 in Caen, France, Lecture Notes in Computer Science, v. 775. Berlin: Springer, 1994, 439--448.

3. (.PDF) Fine hierarchies and Boolean terms. The Journal of Symbolic Logic, 60, N 1 (1995), 289--317.

4. (.PDF) Fine hierarchy and definability in the Lindenbaum algebra. In: Logic: from foundations to applications, Proceedings of the Logic Colloquium-93 in Keele. Oxford, 1996, 425--452.

5. (.PDF) On recursively enumerable structures. Annals of pure and applied logic, (1996), 243--258.

6. (.PDF) Fine hierarchy of regular omega-languages. Theor. Computer Science, 191 (1998), 37--59.

7. (.PDF) Refining the polynomial hierarchy. Algebra and Logic, 38 (1999), --475 (Russian, there is an English translation).

8. (.PDF) A logical approach to decidability of hierarchies of regular star-free languages. In: Proc. of 18-th Int. Symposium on Theor. Aspects of Computer Science STACS-2001 in Dresden, Germany, Lecture Notes in Computer Science, v. 2010. Berlin: Springer, 2001, 539--550.

9. (.PDF) Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. Conference on Foundations of Computation Theory in Riga, Latvia, Lecture Notes in Computer Science, v. 2138. Berlin: Springer, 2001, 323--334.

10. (.PDF) On decidability of classes of hierarchies of regular aperiodic languages. // Algebra and Logic//,41, N 5 (2002), 610--631 (Russian, there is an English translation).

11. (.PDF) Precomplete numberings. Proc. of Int. Conferences on Math. Logic honoring Yu.L. Ershov and A.I. Mal'tsev, Novosibirsk, 2002, 104--143.

12. (.PDF) Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. // Theoret. Informatics Appl.//, 36 (2002), 29--42.

13. (.PDF) Positive structures. In: Computability and Models, Perspectives East and West, S. Barry Cooper and Sergei S. Goncharov, eds., Kluwer Academic/Plenum Publishers, New York, 2003, --350.

14. (.PDF) Wadge degrees of omega-languages of deterministic Turing machines. // Theoretical Informatics and Applications//, 37 (2003), 67--83.

15. (.PDF) Wadge degrees of omega-languages of deterministic Turing machines. Conf. STACS-03, Lecture Notes in Computer Science, v. 2607. Berlin: Springer, 2003, 97--108.

16. (.PDF) A reducibility for the dot-depth hierarchy (jointly with K.W. Wagner). Conf. MFCS-04, Lecture Notes in Computer Science, v. 3153. Berlin: Springer, 2004, 783--793.

17. (.PDF) Boolean hierarchies of partitions over reducible base. // Algebra and Logic//, 43, N 1 (2004), 77--109 (Russian, there is an English translation).

18. (.PDF) Difference hierarchy in varphi-spaces. // Algebra and Logic//, 43, N 4 (2004), 425--444 (Russian, there is an English translation).

19. (.PDF) A reducibility for the dot-depth hierarchy (jointly with K.W. Wagner). // Theoretical Computer Science//, 345, N 2-3 (2005), 448--472.

20. (.PDF) Classifying countable boolean terms. // Algebra and Logic//, 44, N 2 (2005), 173--197 (Russian, there is an English translation).

21. (.PDF) Hierarchies in varphi-spaces and applications. // Math. Logic Quarterly//, 51, N 1 (2005), 45--61.

22. (.PDF) Some reducibilities on regular sets. Conf. «Computability in Europe-2005» (Eds. S.B. Cooper, B. Loewe and Leen Torenvliet), Lecture Notes in Computer Science, v. 3526. Berlin: Springer, 2005, 430--440.

23. (.PDF) Variations on the Wadge reducibility. // Siberian Advances in Math.//, , N 3 (2005), 44--80.

24. (.PDF) Towards a descriptive set theory for domain-like structures. // Theoretical Computer Science//, 365 (2006), 258--282.

25. (.PDF) Undecidability in the homomorphic quasiorder of finite labeled forests (joint with O.V. Kudinov). Conf.Computability in Europe-2006 (Eds. A. Beckman et.al.), Lecture Notes in Computer Science, v. 3988. Berlin: Springer, 2006, 289--296.

26. (.PDF) A useful undecidable theory. Conference Computability in Europe-07,(Eds. S.B. Cooper, B. Loewe and A. Sorbi), Lecture Notes in Computer Science, v. 4497. Berlin: Springer, 2007, 685-694.

27. (.PDF) Definability in the homomorphic quasiorder of finite labeled forests (joint with O.V. Kudinov). Conf.Computability in Europe-2007 (Eds. S.B. Cooper, B. Loewe and A. Sorbi), Lecture Notes in Computer Science, v. 4497. Berlin: Springer, 2007, 436-445.

28. (.PDF) Fine hierarchy of regular aperiodic omega-languages. Conf. DLT-2007 (Eds. T. Harju, J. Karhumaeki and A. Lepisto), Lecture Notes in Computer Science}, v. 4588. Berlin: Springer, 2007, 399-410.

29. (.PDF) Hierarchies of Delta^0_2-measurable k-partitions. // Math. Logic Quarterly, 53//, (2007),446--461.

30. (.PDF) The quotient algebra of labeled forests modulo h-equivalence. // Algebra and Logic, 46, N 2//, (2007), 120--133.

31. (.PDF) Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests (jointly with O.V. Kudinov). // Journal of Logic and Computation, 17//, (2007), 1135--1151.