Marchenkov Sergey Seraphimovich

Publications in Math-Net.Ru

1. Implicatively implicit extensions of two-place symmetric functions in $P_3$
   
   Diskr. Mat., 36:3 (2024),  92–104
2. On implicit extensions in many-valued logic
   
   Diskr. Mat., 35:2 (2023),  34–41
3. Logical extensions of the parametric closure operator
   
   Diskr. Mat., 34:3 (2022),  52–62
4. On polynomial-modular recursive sequences
   
   Diskr. Mat., 34:2 (2022),  43–49
5. On the equality problem of finitely generated classes of exponentially-polynomial functions
   
   Diskr. Mat., 34:1 (2022),  64–75
6. Reducibility by means of almost polynomial functions
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2022, no. 12,  68–78
7. On the complexity of integer polynomial recursive sequences
   
   University proceedings. Volga region. Physical and mathematical sciences, 2022, no. 2,  17–27
8. Completeness criterion with respect to the enumeration closure operator in the three-valued logic
   
   Diskr. Mat., 33:2 (2021),  86–99
9. On the enumeration of maximal infinitely-generated classes of 01-functions in three-valued logic
   
   University proceedings. Volga region. Physical and mathematical sciences, 2021, no. 3,  3–16
10. On the action of the implicative closure operator on the set of partial functions of the multivalued logic
    
    Diskr. Mat., 32:1 (2020),  60–73
11. On the problem of logic-automatic formulas performability
    
    University proceedings. Volga region. Physical and mathematical sciences, 2020, no. 2,  61–71
12. Equational completeness criterion in ternary logic
    
    University proceedings. Volga region. Physical and mathematical sciences, 2019, no. 4,  29–41
13. On alphabetic coding for superwords
    
    Probl. Peredachi Inf., 55:3 (2019),  83–92
14. Extensions of the positive closure operator by using logical connectives
    
    Diskretn. Anal. Issled. Oper., 25:4 (2018),  46–58
15. Completeness criterion for the enumeration closure operator in three-valued logic
    
    Diskr. Mat., 30:4 (2018),  47–54
16. On the complexity of polynomial recurrence sequences
    
    Probl. Peredachi Inf., 54:3 (2018),  67–72
17. On the operations of bounded suffix summation and multiplication
    
    Diskretn. Anal. Issled. Oper., 24:4 (2017),  60–76
18. Basic positively closed classes in three-valued logic
    
    Diskr. Mat., 29:2 (2017),  40–52
19. On parametric closure operator extensions by means of logical connectives
    
    University proceedings. Volga region. Physical and mathematical sciences, 2017, no. 1,  22–31
20. On maximal subalgebras of the algebras of unary recursive functions
    
    Diskretn. Anal. Issled. Oper., 23:3 (2016),  81–92
21. Bounded prefix concatenation operation and finite bases with respect to the superposition
    
    Diskr. Mat., 28:4 (2016),  91–99
22. On FE-precomplete classes in countable-valued logic
    
    Diskr. Mat., 28:2 (2016),  51–57
23. Building a finitely generating system in a group of Kalmar-elementary permutations
    
    University proceedings. Volga region. Physical and mathematical sciences, 2016, no. 2,  13–26
24. On maximal subgroups of the group of recursive permutations
    
    Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 40:3 (2016),  32–36
25. On complexity of solving systems of functional equations in countable-valued logic
    
    Diskretn. Anal. Issled. Oper., 22:2 (2015),  49–62
26. On elementary word functions obtained by bounded prefix concatenation
    
    Diskr. Mat., 27:3 (2015),  44–55
27. Closed classed of three-valued logic that contain essentially multiplace functions
    
    Diskr. Mat., 27:1 (2015),  98–107
28. On complexity of problem of satisfiability for systems of countable-valued functional equations
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2015, no. 8,  25–32
29. Positive closed classes in the three-valued logic
    
    Diskretn. Anal. Issled. Oper., 21:1 (2014),  67–83
30. On maximal and minimal elements in partially ordered sets of Boolean degrees
    
    Diskretn. Anal. Issled. Oper., 20:2 (2013),  88–101
31. Definability in the language of functional equations of a countable-valued logic
    
    Diskr. Mat., 25:4 (2013),  13–23
32. Interpolation and Superpositions of Multivariate Continuous Functions
    
    Mat. Zametki, 93:4 (2013),  566–574
33. On solutions to systems of automata-type functional equations
    
    Diskretn. Anal. Issled. Oper., 19:4 (2012),  86–98
34. Definition of positively closed classes by endomorphism semigroups
    
    Diskr. Mat., 24:4 (2012),  19–26
35. Atoms of the lattice of positively closed classes of three-valued logic
    
    Diskr. Mat., 24:2 (2012),  79–91
36. On classificatons of many-valued logic functions by means of automorphism groups
    
    Diskretn. Anal. Issled. Oper., 18:4 (2011),  66–76
37. The closure operator in many-valued logic based on functional equations
    
    Diskretn. Anal. Issled. Oper., 17:4 (2010),  18–31
38. The uniform $id$-decomposition of functions of many-valued logic over homogeneous functions
    
    Diskr. Mat., 22:4 (2010),  55–63
39. On the complexity of the $\mathscr E^2$ Grzegorczyk class
    
    Diskr. Mat., 22:1 (2010),  5–16
40. Complete and incomplete Boolean degrees
    
    Probl. Peredachi Inf., 46:4 (2010),  83–90
41. On closed classes of a $k$-valued logics functions defined by a single endomorphism
    
    Diskretn. Anal. Issled. Oper., 16:6 (2009),  52–67
42. Positively closed classes of three-valued logic generated by one-place functions
    
    Diskr. Mat., 21:3 (2009),  37–44
43. Orders of Discriminator Classes in Multivalued Logic
    
    Mat. Zametki, 86:4 (2009),  550–556
44. Superpositions of continuous functions defined on a Baire space
    
    Probl. Peredachi Inf., 45:4 (2009),  107–114
45. On solutions of systems of functional Boolean equations
    
    Diskretn. Anal. Issled. Oper., 15:6 (2008),  48–57
46. Эквационально замкнутые классы частичных булевых функций
    
    Diskretn. Anal. Issled. Oper., 15:1 (2008),  82–97
47. The closure operator with the equality predicate branching on the set of partial Boolean functions
    
    Diskr. Mat., 20:3 (2008),  80–88
48. Дискриминаторные позитивно замкнутые классы трёхзначной логики
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  53–66
49. Superpositions of elementary arithmetic functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  33–48
50. A criterion for positive completeness in ternary logic
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006),  27–39
51. On the structure of equationally closed classes
    
    Diskr. Mat., 18:4 (2006),  18–30
52. On the structure of partially ordered sets of Boolean degrees
    
    Diskr. Mat., 18:1 (2006),  63–75
53. Finite generability of closed classes of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005),  101–118
54. Equational closure
    
    Diskr. Mat., 17:2 (2005),  117–126
55. On the Cardinality of the Family of Precomplete Classes in $P_E$
    
    Mat. Zametki, 78:6 (2005),  864–869
56. On the number of maximal subgroups in automaton permutation groups
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  73–79
57. Boolean reducibility
    
    Diskr. Mat., 15:3 (2003),  40–53
58. On the complexity of recurring sequences
    
    Diskr. Mat., 15:2 (2003),  52–62
59. Polynomial Computability of Certain Rudimentary Predicates
    
    Mat. Zametki, 74:1 (2003),  69–75
60. Closure operators with predicate branching
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2003, no. 6,  37–39
61. Clones determined by alternating monoids
    
    Diskr. Mat., 14:2 (2002),  3–8
62. Positive BE-representations of dictionary predicates
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  68–75
63. Impossibility of constructing continuous functions of $(n+1)$ variables from functions of $n$ variables by means of certain continuous operators
    
    Mat. Sb., 192:6 (2001),  71–88
64. On the complexity of the computation of rudimentary predicates
    
    Diskr. Mat., 12:4 (2000),  83–98
65. Functional aspects of the completeness problem for some classes of automaton functions
    
    Diskr. Mat., 12:2 (2000),  103–117
66. $A$-classification of idempotent functions of many-valued logic
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:1 (1999),  19–43
67. On the expressibility of functions of many-valued logic in some logical-functional classes
    
    Diskr. Mat., 11:4 (1999),  110–126
68. On superpositions of continuous functions defined on a Baire space
    
    Mat. Zametki, 66:5 (1999),  696–705
69. $A$-closed classes of idempotent functions of many-valued logic that are defined by two-place relations
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:1 (1998),  32–59
70. $A$-closed classes of many-valued logic that contain constants
    
    Diskr. Mat., 10:3 (1998),  10–26
71. On Slupecki classes for deterministic functions
    
    Diskr. Mat., 10:2 (1998),  128–136
72. The invariants of Post classes
    
    Fundam. Prikl. Mat., 4:4 (1998),  1385–1404
73. $A$-classification of finite injective functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997),  15–42
74. $S$-classification of functions of many-valued logic
    
    Diskr. Mat., 9:3 (1997),  125–152
75. Clone classification of dually discriminator algebras with finite support
    
    Mat. Zametki, 61:3 (1997),  359–366
76. $G$-precomplete classes of many-valued logic
    
    Diskretn. Anal. Issled. Oper., 3:3 (1996),  47–70
77. $S$-classification of idempotent algebras with finite support
    
    Dokl. Akad. Nauk, 348:5 (1996),  587–589
78. Basic relations for the $S$-classification of functions of multivalued logic
    
    Diskr. Mat., 8:1 (1996),  99–128
79. On closed classes in $k$-valued logic that contain a homogeneous switching function
    
    Diskretn. Anal. Issled. Oper., 2:2 (1995),  49–61
80. Precomplete classes in the Cartesian products of $P_2$ and $P_3$
    
    Diskr. Mat., 6:2 (1994),  21–42
81. On the $id$-decompositions of the class $P_k$ over precomplete classes
    
    Diskr. Mat., 5:2 (1993),  98–110
82. Maximal subalgebras in products of the Post iterative algebras $\mathfrak{P}_2$ and $\mathfrak{P}_3$
    
    Dokl. Akad. Nauk, 324:3 (1992),  525–528
83. On Slupecki classes in the systems $P_k\times\dots\times P_l$
    
    Diskr. Mat., 4:3 (1992),  135–148
84. On completeness in the system $P_3\times P_3$
    
    Diskr. Mat., 4:1 (1992),  126–145
85. On the degree of uniform id-decomposition of closed classes in $P_k$
    
    Diskr. Mat., 3:4 (1991),  128–142
86. Uniform id-decomposition of Boolean functions
    
    Diskr. Mat., 2:3 (1990),  29–41
87. Representation of dictionary predicates from the arithmetical hierarchy
    
    Diskr. Mat., 2:1 (1990),  87–93
88. The existence of infinite bases with respect to superposition in certain classes of one-place functions
    
    Mat. Zametki, 47:4 (1990),  55–62
89. Finite initial segments of the upper semilattice of finite-automaton degrees
    
    Diskr. Mat., 1:3 (1989),  96–103
90. The complexity of the search for a deterministic subautomaton
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1988, no. 7,  52–56
91. Existence of superposition bases in countable primitively recursively closed classes
    
    Mat. Zametki, 39:2 (1986),  268–276
92. On the existence of finite bases in closed classes of Boolean functions
    
    Algebra Logika, 23:1 (1984),  88–99
93. On the classification of algebras with alternating group of automorphisms
    
    Dokl. Akad. Nauk SSSR, 265:3 (1982),  533–536
94. The complexity of computing exponents
    
    Mat. Zametki, 31:3 (1982),  457–463
95. Undecidability of the positive $\forall\exists$-theory of a free semigroup
    
    Sibirsk. Mat. Zh., 23:1 (1982),  196–198
96. On homogeneous algebras
    
    Dokl. Akad. Nauk SSSR, 256:4 (1981),  787–790
97. Existence of superposition bases in countable primitive-recursively closed classes of one-place functions
    
    Mat. Zametki, 27:6 (1980),  877–883
98. A superposition basis in the class of Kal'mar elementary functions
    
    Mat. Zametki, 27:3 (1980),  321–332
99. Complexity of algorithms and computations
    
    Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 16 (1979),  103–149
100. A method of constructing maximal subalgebras in algebras of general recursive functions
     
     Algebra Logika, 17:5 (1978),  581–595
101. On recursively enumerable minimal btt-degrees
     
     Mat. Sb. (N.S.), 103(145):4(8) (1977),  550–562
102. One class of partial sets
     
     Mat. Zametki, 20:4 (1976),  473–478
103. Tabular powers of maximal sets
     
     Mat. Zametki, 20:3 (1976),  373–381
104. On the congruence of the upper semilattices of recursively enumerable $m$-powers and tabular powers
     
     Mat. Zametki, 20:1 (1976),  19–26
105. The existence of recursively enumerable minimal truth-table degrees
     
     Algebra Logika, 14:4 (1975),  422–429
106. Elementary Skolem functions
     
     Mat. Zametki, 17:1 (1975),  133–141
107. Existence of families without positive numerations
     
     Mat. Zametki, 13:4 (1973),  597–604
108. Computable numerations of families of general recursive functions
     
     Algebra Logika, 11:5 (1972),  588–607
109. On semilattices of computable numerations
     
     Dokl. Akad. Nauk SSSR, 198:4 (1971),  766–768
110. On minimal numerations of systems of recursively enumerable sets
     
     Dokl. Akad. Nauk SSSR, 198:3 (1971),  530–532
111. Elimination of recursion schemas in the Grzegorczyk $\mathscr E^2$ class
     
     Mat. Zametki, 5:5 (1969),  561–568