Morozov Andrei Sergeevich

Publications in Math-Net.Ru

1. On weakly coholographic structures
   
   Sibirsk. Mat. Zh., 66:3 (2025),  378–388
2. Groups of permutations and ideals of Turing degrees
   
   Algebra Logika, 63:2 (2024),  209–224
3. Turing spectra of the automorphism groups of the order on the rationals
   
   Sibirsk. Mat. Zh., 65:6 (2024),  1207–1213
4. Itbm-constructive completions of algebras
   
   Sibirsk. Mat. Zh., 65:3 (2024),  533–544
5. Lower semilattices of separable congruences of numbered algebras
   
   Sibirsk. Mat. Zh., 64:4 (2023),  753–769
6. Families of permutations and ideals of Turing degrees
   
   Algebra Logika, 61:6 (2022),  706–719
7. On weakly holographic structures
   
   Sibirsk. Mat. Zh., 63:6 (2022),  1276–1289
8. $T_1$-separable numberings of subdirectly indecomposable algebras
   
   Algebra Logika, 60:4 (2021),  400–424
9. Characterizations of ITBM-computability. II
   
   Algebra Logika, 60:1 (2021),  39–56
10. Characterizations of ITBM-computability. I
    
    Algebra Logika, 59:6 (2020),  627–648
11. Minimal predicates for $\Delta$-definability
    
    Algebra Logika, 59:4 (2020),  480–499
12. Turing degrees and automorphism groups of substructure lattices
    
    Algebra Logika, 59:1 (2020),  27–47
13. $\Sigma$-preorderings in ${\mathbb{HF}(\mathbb{R})}$
    
    Algebra Logika, 58:5 (2019),  609–626
14. On mutual definability of operations on fields
    
    Sibirsk. Mat. Zh., 60:6 (2019),  1324–1334
15. On holographic structures
    
    Sibirsk. Mat. Zh., 60:2 (2019),  401–410
16. A computably enumerable partial ordering without computably enumerable maximal chains and antichains
    
    Sibirsk. Mat. Zh., 59:3 (2018),  587–595
17. Nonpresentability of some structures of analysis in hereditarily finite superstructures
    
    Algebra Logika, 56:6 (2017),  691–711
18. The computational power of infinite time Blum–Shub–Smale machines
    
    Algebra Logika, 56:1 (2017),  55–92
19. On some reducibility and existential interpretability of structures
    
    Sibirsk. Mat. Zh., 58:2 (2017),  365–374
20. A sufficient condition for nonpresentability of structures in hereditarily finite superstructures
    
    Algebra Logika, 55:3 (2016),  366–379
21. Definability of linear orders over negative equivalences
    
    Algebra Logika, 55:1 (2016),  37–57
22. $\Sigma$-presentations of the ordering on the reals
    
    Algebra Logika, 53:3 (2014),  340–371
23. On the existential interpretability of structures
    
    Sib. Èlektron. Mat. Izv., 11 (2014),  557–566
24. On $\Sigma$-rigid presentations of the real order
    
    Sibirsk. Mat. Zh., 55:3 (2014),  562–572
25. Nonpresentability of the semigroup $\omega^\omega$ over $\mathbb{HF(R)}$
    
    Sibirsk. Mat. Zh., 55:1 (2014),  156–164
26. Some presentations of the real number field
    
    Algebra Logika, 51:1 (2012),  96–128
27. On some representations of the real number field
    
    Algebra Logika, 50:2 (2011),  270–271
28. Simple structures with complex symmetry
    
    Algebra Logika, 49:1 (2010),  98–134
29. On decidability of the decomposability problem for finite theories
    
    Sibirsk. Mat. Zh., 51:4 (2010),  838–847
30. On computable automorphisms in formal concept analysis
    
    Sibirsk. Mat. Zh., 51:2 (2010),  357–366
31. On effective presentations of formal concept lattices
    
    Sibirsk. Mat. Zh., 50:3 (2009),  603–620
32. $\Sigma$-Definability of countable structures over real numbers, complex numbers, and quaternions
    
    Algebra Logika, 47:3 (2008),  335–363
33. Definable sets in automorphism groups of rational order
    
    Algebra Logika, 47:2 (2008),  215–239
34. On the index sets of $\Sigma$-subsets of the real numbers
    
    Sibirsk. Mat. Zh., 49:6 (2008),  1351–1360
35. The categoricity of the group of all computable automorphisms of the rational numbers
    
    Algebra Logika, 46:5 (2007),  649–662
36. On computable formal concepts in computable formal contexts
    
    Sibirsk. Mat. Zh., 48:5 (2007),  1083–1092
37. Elementary submodels of parametrizable models
    
    Sibirsk. Mat. Zh., 47:3 (2006),  595–612
38. About the admissible predicates on admissible sets
    
    Sibirsk. Mat. Zh., 46:4 (2005),  841–850
39. On automorphic tuples of elements in computable models
    
    Sibirsk. Mat. Zh., 46:3 (2005),  523–532
40. $\Sigma$-Subsets of Natural Numbers
    
    Algebra Logika, 43:3 (2004),  291–320
41. On homeomorphisms of effective topological spaces
    
    Sibirsk. Mat. Zh., 45:5 (2004),  1160–1177
42. On the relation of $\Sigma$-reducibility between admissible sets
    
    Sibirsk. Mat. Zh., 45:3 (2004),  634–652
43. Boolean algebras with finite families of computable automorphisms
    
    Sibirsk. Mat. Zh., 45:1 (2004),  171–177
44. On the problem of finite signature
    
    Sibirsk. Mat. Zh., 44:1 (2003),  206–210
45. Presentability of Groups of $\Sigma$-Definable Permutations over Admissible Sets
    
    Algebra Logika, 41:4 (2002),  459–480
46. On a hierarchy of groups of computable automorphisms
    
    Sibirsk. Mat. Zh., 43:1 (2002),  155–160
47. Once again on the Higman question
    
    Algebra Logika, 39:2 (2000),  134–144
48. A $\Sigma$-set of natural numbers not enumerable by natural numbers
    
    Sibirsk. Mat. Zh., 41:6 (2000),  1404–1408
49. Once more on countably categorical sentences
    
    Sibirsk. Mat. Zh., 40:2 (1999),  434–438
50. Endomorphisms of the group of all recursive permutations
    
    Algebra Logika, 36:1 (1997),  54–76
51. Turing reducibility as algebraic embeddability
    
    Sibirsk. Mat. Zh., 38:2 (1997),  362–364
52. On automorphism groups of solvable models
    
    Algebra Logika, 34:4 (1995),  437–447
53. Functional trees and automorphisms of models
    
    Algebra Logika, 32:1 (1993),  54–72
54. Recursive automorphisms of atomic Boolean algebras
    
    Algebra Logika, 29:4 (1990),  464–490
55. On a problem of Higman
    
    Algebra Logika, 29:1 (1990),  29–34
56. Rigid constructive modules
    
    Algebra Logika, 28:5 (1989),  570–583
57. Elementary properties of groups of recursive permutations
    
    Dokl. Akad. Nauk SSSR, 305:2 (1989),  274–276
58. On theories of classes of groups of recursive permutations
    
    Trudy Inst. Mat. Sib. Otd. AN SSSR, 12 (1989),  91–104
59. A countably categorical decidable model without nontrivial recursive automorphisms
    
    Sibirsk. Mat. Zh., 30:2 (1989),  221–224
60. Permutations and implicit definability
    
    Algebra Logika, 27:1 (1988),  19–36
61. On a class of recursively enumerable sets
    
    Sibirsk. Mat. Zh., 28:2 (1987),  124–128
62. On a problem of Bergstra and Tiuryn
    
    Algebra Logika, 25:5 (1986),  566–583
63. On computable groups of automorphisms of models
    
    Algebra Logika, 25:4 (1986),  415–424
64. Constructive boolean algebras with almost-identical automorphisms
    
    Mat. Zametki, 37:4 (1985),  478–482
65. Automorphisms of constructivizations of Boolean algebras
    
    Sibirsk. Mat. Zh., 26:4 (1985),  98–110
66. Group $\mathrm{Aut}_r\langle Q,\le\rangle$ is not constructivizable
    
    Mat. Zametki, 36:4 (1984),  473–478
67. Groups of recursive automorphisms of constructive Boolean algebras
    
    Algebra Logika, 22:2 (1983),  138–158
68. Countable homogeneous Boolean algebras
    
    Algebra Logika, 21:3 (1982),  269–282
69. Strong constructivizability of countable saturated Boolean algebras
    
    Algebra Logika, 21:2 (1982),  193–203
70. Decidability of theories of Boolean algebras with a distinguished ideal
    
    Sibirsk. Mat. Zh., 23:1 (1982),  199–201


71. In memory of Valeriy Matveevich Kopytov
    
    Algebra Logika, 61:6 (2022),  I–IV
72. Yurii Leonidovich Ershov (on his 80th birthday)
    
    Uspekhi Mat. Nauk, 75:3(453) (2020),  191–194
73. Evgenii Andreevich Palyutin (1945–2018)
    
    Sib. Èlektron. Mat. Izv., 16 (2019),  1–10
74. Yurii Leonidovich Ershov (on the occasion of his 75th birthday)
    
    Sibirsk. Mat. Zh., 56:3 (2015),  477–480
75. Sergei Ilyich Mardaev (6.04.1962–10.04.2013)
    
    Sib. Èlektron. Mat. Izv., 10 (2013),  30–34
76. Yurii Leonidovich Ershov (on his seventieth birthday)
    
    Uspekhi Mat. Nauk, 66:1(397) (2011),  201–204
77. Sergei Savost'yanovich Goncharov (on the occasion of his 60th birthday)
    
    Sibirsk. Mat. Zh., 52:5 (2011),  959–961
78. Yurii Leonidovich Ershov (on his seventieth birthday)
    
    Vladikavkaz. Mat. Zh., 12:2 (2010),  75–78
79. 9th Asian Logic Conference, Novosibirsk, Russia, 16–19 August 2005
    
    Sib. Èlektron. Mat. Izv., 2 (2005),  10–11
80. Yuri Leonidovich Ershov (on his 60th birthday)
    
    Uspekhi Mat. Nauk, 55:6(336) (2000),  173–182
81. Yuriĭ Leonidovich Ershov (on the occasion of his sixtieth birthday)
    
    Vladikavkaz. Mat. Zh., 2:2 (2000),  3–9