The following pages link to Sergey S. Marchenkov (Q314212):
Displaying 50 items.
- (Q226481) (redirect page) (← links)
- Functional equations for the functions of real variables (Q263953) (← links)
- On elementary word functions obtained by bounded prefix concatenation (Q314213) (← links)
- On maximal subgroups of the group of recursive permutations (Q344028) (← links)
- Interpolation and superpositions of multivariate continuous functions (Q351657) (← links)
- The FE-closure operator in countable-valued logic (Q384749) (← links)
- Operator of positive closure (Q416948) (← links)
- On a recursive definition of a class of finite automaton functions (Q493724) (← links)
- On solutions to systems of functional equations of multiple-valued logic (Q736022) (← links)
- Existence of finite bases in closed classes of Boolean functions (Q760428) (← links)
- Complete and incomplete Boolean degrees (Q764088) (← links)
- The complexity of computing exponents (Q787966) (← links)
- Solutions to the systems of functional equations of multivalued logic (Q845539) (← links)
- On the enumeration closure operator in multivalued logic (Q893188) (← links)
- On complexity of problem of satisfiability for systems of countable-valued functional equations (Q905075) (← links)
- Existence of infinite bases with respect to superposition in certain classes of one-place functions (Q920082) (← links)
- Strong closure operators on the set of partial Boolean functions (Q951723) (← links)
- Orders of discriminator classes in multivalued logic (Q1048602) (← links)
- Existence of superposition bases in countable primitively recursively closed classes (Q1098839) (← links)
- A method for constructing maximal subalgebras of algebras of general recursive functions (Q1137992) (← links)
- Existence of superposition bases in countable primitive-recursively closed classes of one-place functions (Q1149945) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- A superposition basis in the class of Kalmar elementary functions (Q1163014) (← links)
- Existence of families without positive numerations (Q1217799) (← links)
- Elementary Skolem functions (Q1221750) (← links)
- (Q1244336) (redirect page) (← links)
- On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers (Q1244337) (← links)
- The existence of recursively enumerable minimal truth-tabular degrees (Q1246422) (← links)
- Tabular powers of maximal sets (Q1246423) (← links)
- One class of partial sets (Q1253250) (← links)
- Clone classification of dually discriminator algebras with finite support (Q1274106) (← links)
- The \(S\)-classification of idempotent algebras with a finite support (Q1380284) (← links)
- On superpositions of continuous functions defined on the Baire space (Q1582831) (← links)
- \(A\)-classification of functions of many-valued logic (Q1594416) (← links)
- Basic positively closed classes in three-valued logic (Q1669569) (← links)
- On FE-precomplete classes in countable-valued logic (Q1675534) (← links)
- Calculating the number of functions with a given endomorphism (Q1735209) (← links)
- Bounded prefix concatenation operation and finite bases with respect to the superposition (Q1744291) (← links)
- Mixed id-expansion of multivalued logic functions (Q1759083) (← links)
- FE classification of functions of many-valued logic (Q1759121) (← links)
- Iteration operators on a set of continuous functions of Baire space (Q1759129) (← links)
- On orders of closed classes containing a homogeneous switching function (Q1759160) (← links)
- Computations on counter machines with summator (Q1789205) (← links)
- The computable enumerations of families of general recursive functions (Q1843427) (← links)
- On the polynomial computability of some rudimentary predicates. (Q1889506) (← links)
- Bounded monotone recursion and multihead automata (Q2017762) (← links)
- On the action of the implicative closure operator on the set of partial functions of the multivalued logic (Q2050224) (← links)
- Infinitely generated classes of 01-functions of three-valued logic (Q2058708) (← links)
- Completeness criterion with respect to the enumeration closure operator in the three-valued logic (Q2088721) (← links)
- Implicit expressibility in multiple-valued logic (Q2107856) (← links)
