|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
1. |
P. E. Alaev, V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. II”, Algebra Logika, 60:6 (2021), 533–548 |
2
|
2. |
V. L. Selivanov, “Effective Wadge hierarchy in computable quasi-Polish spaces”, Sib. Èlektron. Mat. Izv., 18:1 (2021), 121–135 |
3
|
|
2019 |
3. |
P. E. Alaev, V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. I”, Algebra Logika, 58:6 (2019), 673–705 ; Algebra and Logic, 58:6 (2020), 447–469 |
18
|
|
2018 |
4. |
V. L. Selivanov, M. M. Yamaleev, “Turing degrees in refinements of the arithmetical hierarchy”, Algebra Logika, 57:3 (2018), 338–361 ; Algebra and Logic, 57:3 (2018), 222–236 |
3
|
5. |
P. E. Alaev, V. L. Selivanov, “Polynomial computability of fields of algebraic numbers”, Dokl. Akad. Nauk, 481:4 (2018), 355–357 ; Dokl. Math., 98:1 (2018), 341–343 |
2
|
6. |
I. Sh. Kalimullin, V. L. Selivanov, A. N. Frolov, “Degree spectra of structures”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 158 (2018), 23–39 ; J. Math. Sci. (N. Y.), 256:2 (2021), 143–159 |
2
|
7. |
V. L. Selivanov, “Precomplete numberings”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 157 (2018), 106–134 ; J. Math. Sci. (N. Y.), 256:1 (2021), 96–124 |
3
|
|
2013 |
8. |
A. S. Konovalov, V. L. Selivanov, “Boolean algebras of regular languages”, Algebra Logika, 52:6 (2013), 676–711 ; Algebra and Logic, 52:6 (2014), 448–470 |
|
2010 |
9. |
A. V. Zhukov, O. V. Kudinov, V. L. Selivanov, “Definability of closure operations in the $h$-quasiorder of labeled forests”, Algebra Logika, 49:2 (2010), 181–194 ; Algebra and Logic, 49:2 (2010), 120–129 |
1
|
10. |
O. V. Kudinov, V. L. Selivanov, L. V. Yartseva, “Definability in the structure of words with the inclusion relation”, Sibirsk. Mat. Zh., 51:3 (2010), 575–583 ; Siberian Math. J., 51:3 (2010), 456–462 |
1
|
|
2007 |
11. |
V. L. Selivanov, “The quotient algebra of labeled forests modulo $h$-equivalence”, Algebra Logika, 46:2 (2007), 217–243 ; Algebra and Logic, 46:2 (2007), 120–133 |
14
|
|
2005 |
12. |
V. L. Selivanov, “Classifying Countable Boolean Terms”, Algebra Logika, 44:2 (2005), 173–197 ; Algebra and Logic, 44:2 (2005), 95–108 |
4
|
13. |
V. L. Selivanov, “Variations on the Wadge Reducibility”, Mat. Tr., 8:1 (2005), 135–175 ; Siberian Adv. Math., 15:3 (2005), 44–80 |
16
|
|
2004 |
14. |
V. L. Selivanov, “Difference Hierarchy in $\varphi$-Spaces”, Algebra Logika, 43:4 (2004), 425–444 ; Algebra and Logic, 43:3 (2004), 238–248 |
17
|
15. |
V. L. Selivanov, “Boolean Hierarchies of Partitions over a Reducible Base”, Algebra Logika, 43:1 (2004), 77–109 ; Algebra and Logic, 43:1 (2004), 44–61 |
31
|
|
2002 |
16. |
V. L. Selivanov, “Decidability of Hierarchies of Regular Aperiodic Languages”, Algebra Logika, 41:5 (2002), 610–631 ; Algebra and Logic, 41:5 (2002), 337–348 |
1
|
|
1999 |
17. |
V. L. Selivanov, “Refining the polynomial hierarchy”, Algebra Logika, 38:4 (1999), 456–475 |
5
|
|
1992 |
18. |
V. L. Selivanov, “Precomplete numberings and functions without fixed points”, Mat. Zametki, 51:1 (1992), 149–155 ; Math. Notes, 51:1 (1992), 95–99 |
3
|
|
1991 |
19. |
V. L. Selivanov, “The fine hierarchy and definable index sets”, Algebra Logika, 30:6 (1991), 705–725 |
11
|
20. |
V. L. Selivanov, “Fine hierarchy of formulas”, Algebra Logika, 30:5 (1991), 568–582 |
5
|
21. |
V. L. Selivanov, “Jumps of certain classes of $\Delta^0_2$-sets”, Mat. Zametki, 50:6 (1991), 122–125 ; Math. Notes, 50:6 (1991), 1299–1300 |
1
|
|
1990 |
22. |
V. L. Selivanov, “Index sets of classes of hyperhypersimple sets”, Algebra Logika, 29:2 (1990), 220–240 |
5
|
|
1989 |
23. |
V. L. Selivanov, “Applications of precomplete numerations to $tt$-degrees and
index sets”, Algebra Logika, 28:1 (1989), 75–82 |
4
|
24. |
V. L. Selivanov, “Fine hierarchies of arithmetic sets, and definable index sets”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989), 165–185 |
25. |
S. P. Odintsov, V. L. Selivanov, “The arithmetical hierarchy and ideals of enumerated Boolean algebras”, Sibirsk. Mat. Zh., 30:6 (1989), 140–149 ; Siberian Math. J., 30:6 (1989), 952–960 |
12
|
|
1988 |
26. |
V. L. Selivanov, “Ershov's hierarchy and $\rm T$-jumps”, Algebra Logika, 27:4 (1988), 464–478 |
2
|
27. |
V. L. Selivanov, “Index sets of quotient-objects of the Post numeration”, Algebra Logika, 27:3 (1988), 343–358 |
14
|
28. |
V. L. Selivanov, “Algorithmic complexity of algebraic systems”, Mat. Zametki, 44:6 (1988), 823–832 ; Math. Notes, 44:6 (1988), 944–950 |
8
|
|
1987 |
29. |
V. L. Selivanov, “Automorphism groups of numbered sets”, Mat. Zametki, 41:4 (1987), 592–597 ; Math. Notes, 41:4 (1987), 330–333 |
1
|
|
1985 |
30. |
V. L. Selivanov, “The Ershov hierarchy”, Sibirsk. Mat. Zh., 26:1 (1985), 134–149 ; Siberian Math. J., 26:1 (1985), 105–117 |
13
|
|
1984 |
31. |
V. L. Selivanov, “On the hierarchy of limit computations”, Sibirsk. Mat. Zh., 25:5 (1984), 146–156 ; Siberian Math. J., 25:5 (1984), 798–806 |
4
|
32. |
V. L. Selivanov, “Index sets in the hyperarithmetical hierarchy”, Sibirsk. Mat. Zh., 25:3 (1984), 164–181 ; Siberian Math. J., 25:3 (1984), 474–488 |
8
|
|
1983 |
33. |
V. L. Selivanov, “Hierarchies of hyperarithmetic sets and functions”, Algebra Logika, 22:6 (1983), 666–692 |
5
|
|
1982 |
34. |
V. L. Selivanov, “The structure of degrees of generalized index sets”, Algebra Logika, 21:4 (1982), 472–491 |
6
|
35. |
V. L. Selivanov, “Index sets in the Kleene–Mostowski hierarchy”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 2 (1982), 135–158 |
|
1979 |
36. |
V. L. Selivanov, “The structure of degrees of unsolvability of index sets”, Algebra Logika, 18:4 (1979), 463–480 |
3
|
|
1978 |
37. |
V. L. Selivanov, “Several remarks on classes of recursively enumerable sets”, Sibirsk. Mat. Zh., 19:1 (1978), 153–160 ; Siberian Math. J., 19:1 (1978), 109–114 |
5
|
|
1977 |
38. |
V. L. Selivanov, “Enumerations of canonically computable families of finite sets”, Sibirsk. Mat. Zh., 18:6 (1977), 1373–1380 ; Siberian Math. J., 18:6 (1977), 973–979 |
|
1976 |
39. |
V. L. Selivanov, “Two theorems on computable numerations”, Algebra Logika, 15:4 (1976), 470–484 |
4
|
40. |
V. L. Selivanov, “The numerations of families of general recursive functions”, Algebra Logika, 15:2 (1976), 205–226 |
3
|
|
|
|
2024 |
41. |
A. N. Abyzov, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, I. Sh. Kalimullin, V. L. Selivanov, A. L. Semenov, A. Tuganbaev, M. Kh. Faizrahmanov, “Marat Mirzaevich Arslanov (on his eightieth birthday)”, Uspekhi Mat. Nauk, 79:2(476) (2024), 189–193 ; Russian Math. Surveys, 79:2 (2024), 369–373 |
|
2019 |
42. |
I. Sh. Kalimullin, V. L. Selivanov, “On the 75th birth anniversary of Marat Mirzaevich Arslanov”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 161:1 (2019), 152–160 |
|
Presentations in Math-Net.Ru |
1. |
Boole vs Wadge: comparing basic tools of descriptive set theory V. L. Selivanov
Second Conference of Russian Mathematical Centers. Section «Mathematical Logic and Theoretical Computer Science» November 7, 2022 15:00
|
2. |
A Mathematical Journey Victor Selivanov
Fourth Workshop on Digitalization and Computable Models (WDCM-2022) October 29, 2022 17:40
|
3. |
Primitive Recursive Ordered Fields and Some Applications V. L. Selivanov
Seminars
"Proof Theory" and "Logic Online Seminar" October 4, 2021 18:30
|
4. |
Effective Wadge Hierarchy in Computable Quasi-Polish Spaces V. L. Selivanov
August 9, 2021 15:20
|
5. |
Complexity of structures P. E. Alaev, V. L. Selivanov
Adian 90: Conference on Mathematical Logic, Algebra, and Computation July 8, 2021 12:45
|
6. |
Вычисления с бесконечными данными. Лекция 4. Представление о вычислимом анализе V. L. Selivanov
November 28, 2020 13:50
|
7. |
Вычисления с бесконечными данными. Лекция 3. Автоматы и бесконечные игры V. L. Selivanov
November 28, 2020 12:00
|
|
|
Organisations |
|
|
|
|