| Full list of publications: |
|
|
Citations (Crossref Cited-By Service + Math-Net.Ru) |
|
|
| 1. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Negative numberings in admissible sets. II”, Siberian Adv. Math., 34:1 (2024), 41–66   |
| 2. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Negative numberings in admissible sets. I”, Siberian Adv. Math., 33:4 (2023), 293–321  |
| 3. |
A. S. Morozov, V. G. Puzarenko, M. Kh. Faizrahmanov, “Families of permutations and ideals of Turing degrees”, Algebra Logika, 61:6 (2022), 706–719 |
| 4. |
M. Kh. Faizrahmanov, V. G. Puzarenko, “Absolute and relative properties of negatively numbered families”, Lobachevskii J. Math., 42:4 (2021), 726–734   
|
1
[x]
|
| 5. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Semidecidable numberings in admissible sets”, Algebra and Logic, 59:3 (2020), 273–277 |
| 6. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Computable positive and Friedberg numberings in hyperarithmetic”, Algebra and Logic, 59:1 (2020), 46–58 |
| 7. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, Siberian Math. J., 61:3 (2020), 478–489 |
| 8. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Partial decidable presentations in hyperarithmetic”, Siberian Math. J., 60:3 (2019), 464–471 |
| 9. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Positive presentations of families in relation to reducibility with respect to enumerability”, Algebra and Logic, 57:4 (2018), 320–323 |
| 10. |
I. Sh. Kalimullin, A. Kach, A. Montalbán, V. G. Puzarenko, M. Kh. Faizrakhmanov, “Jump inversions of algebraic structures and the $\Sigma$-definability”, Algebra and Logic, 57:2 (2018), 161–165 |
| 11. |
R. R. Avdeev, V. G. Puzarenko, “A computable structure with non-standard computability”, Siberian Adv. Math., 29:2 (2019), 77–115 |
| 12. |
I. Sh. Kalimullin, V. G. Puzarenko, M. Kh. Faizrahmanov, “Positive presentations of families relative to $e$-oracles”, Siberian Math. J., 59:4 (2018), 648–656 |
| 13. |
R. R. Avdeev, V. G. Puzarenko, “A computable structure with nonstandard computability”, Algebra and Logic, 56:5 (2017), 425–426 |
| 14. |
V. G. Puzarenko, K. V. Storozhuk, “Compactness and Convergence of Monotone Subnets”, Math. Notes, 97:6 (2015), 968–969 |
| 15. |
V. G. Puzarenko, “Countably categorical theories”, Algebra and Logic, 51:3 (2012), 241–258  |
| 16. |
V. G. Puzarenko, “Fixed points for the jump operator”, Algebra and Logic, 50:5 (2011), 418–438 |
| 17. |
V. G. Puzarenko, “Existence of saturated structures”, Siberian Math. J., 52:2 (2011), 311–315 |
| 18. |
V. G. Puzarenko, “A semilattice of numberings. II”, Algebra and Logic, 49:4 (2010), 340–353 |
| 19. |
V. G. Puzarenko, “Descriptive properties on admissible sets”, Algebra and Logic, 49:2 (2010), 160–176 |
| 20. |
I. Sh. Kalimullin, V. G. Puzarenko, “Reducibility on families”, Algebra and Logic, 48:1 (2009), 20–32 |
| 21. |
V. G. Puzarenko, “On a semilattice of numberings”, Siberian Adv. Math., 20:2 (2010), 128–154 |
| 22. |
V. G. Puzarenko, “A certain reducibility on admissible sets”, Siberian Math. J., 50:2 (2009), 330–340 |
| 23. |
V. G. Puzarenko, “On collection of all computable subsets on admissible sets”, Sib. Èlektron. Mat. Izv., 5 (2008), 1–7 |
| 24. |
V. G. Puzarenko, “Computability in special models”, Siberian Math. J., 46:1 (2005), 148–165 |
| 25. |
V. G. Puzarenko, “The Löwenheim–Skolem–Mal'tsev Theorem for $\mathbb{HF}$-Structures”, Algebra and Logic, 43:6 (2004), 418–423 |
| 26. |
A. S. Morozov, V. G. Puzarenko, “$\Sigma$-Subsets of Natural Numbers”, Algebra and Logic, 43:3 (2004), 162–178 |
| 27. |
I. Sh. Kalimullin, V. G. Puzarenko, “Computability Principles on Admissible Sets”, Siberian Adv. Math., 15:4 (2005), 1–33 |
| 28. |
Puzarenko V.G., “Obobschennye numeratsii i opredelimost polya $\mathbb{R}$ v dopustimykh mnozhestvakh”, Vestnik Novosibirskogo Gosudarstvennogo universiteta. seriya: matematika, mekhanika, informatika, 3:2 (2003), 107–117 |
| 29. |
V. G. Puzarenko, “Decidable Computable $\mathbb A$-Numberings”, Algebra and Logic, 41:5 (2002), 314–322 |
| 30. |
V. G. Puzarenko, “Model Theory for Hereditarily Finite Superstructures”, Algebra and Logic, 41:2 (2002), 111–123 |
| 31. |
V. G. Puzarenko, “On the computability over models of decidable theories”, Algebra and Logic, 39:2 (2000), 98–113 |
| 32. |
L. D. Beklemishev, A. V. Vasil'ev, E. P. Vdovin, S. S. Goncharov, V. V. Kozlov, P. S. Kolesnikov, V. D. Mazurov, Yu. V. Matiyasevich, A. S. Morozov, A. N. Parshin, V. G. Puzarenko, M. V. Schwidefsky, “Yurii Leonidovich Ershov (on his 80th birthday)”, Russian Math. Surveys, 75:3 (2020), 581–585  |
| 33. |
Yu. L. Ershov, S. S. Goncharov, V. D. Mazurov, B. S. Baizhanov, B. Sh. Kulpeshov, P. E. Alaev, A. V. Vasil'ev, E. V. Vasil'ev, E. P. Vdovin, V. V. Verbovskii, A. A. Vikent'ev, D. Yu. Vlasov, M. A. Grechkoseeva, V. N. Zhelyabin, P. S. Kolesnikov, V. M. Kopytov, L. L. Maksimova, I. A. Mal'tsev, A. S. Morozov, A. A. Nikitin, E. V. Ovchinnikova, S. P. Odintsov, D. E. Pal'chunov, N. A. Peryazev, A. G. Pinus, L. N. Pobedin, A. P. Pozhidaev, B. Poizat, V. G. Puzarenko, D. O. Revin, V. N. Remeslennikov, N. S. Romanovskii, A. N. Ryaskin, S. S. Starchenko, A. A. Stepanova, S. V. Sudoplatov, E. I. Timoshenko, D. A. Tusupov, N. G. Khisamiev, V. A. Churkin, Z. Chatzidakis, M. V. Schwidefsky, K. M. Shegirov, I. P. Shestakov, “Evgenii Andreevich Palyutin (1945–2018)”, Sib. Èlektron. Mat. Izv., 16 (2019), 1–10 |
| 34. |
P. E. Alaev, O. V. Bogopolski, A. V. Vasil'ev, S. S. Goncharov, Yu. L. Ershov, V. D. Mazurov, L. L. Maksimova, A. S. Morozov, S. P. Odintsov, D. E. Palchunov, V. G. Puzarenko, V. V. Rybakov, K. L. Rychkov, A. N. Ryaskin, I. A. Taimanov, A. S. Filyurin, D. G. Khramtsov, V. A. Churkin, “Sergei Ilyich Mardaev (6.04.1962–10.04.2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 30–34 |
|
Contact us: