Sergey S. Marchenkov

From MaRDI portal
Person:314212

Available identifiers

zbMath Open marchenkov.sergey-sMaRDI QIDQ314212

List of research outcomes

PublicationDate of PublicationType
On polynomial-modular recursive sequences2023-11-17Paper
On the equality problem of finitely generated classes of exponentially-polynomial functions2023-08-15Paper
Reducibility by means of almost polynomial functions2023-07-14Paper
Operation of bound prefix concatenation and finite superposition bases2023-05-25Paper
Implicit expressibility in multiple-valued logic2022-12-05Paper
Completeness criterion with respect to the enumeration closure operator in the three-valued logic2022-10-06Paper
Infinitely generated classes of 01-functions of three-valued logic2021-12-09Paper
On the action of the implicative closure operator on the set of partial functions of the multivalued logic2021-08-30Paper
Modeling multitape Minsky and Turing machines by three-tape Minsky machines2021-02-09Paper
Completeness criterion in class of exponential-polynomial functions2021-01-15Paper
On alphabetic coding for superwords2020-06-23Paper
Completeness criterion for the enumeration closure operator in three-valued logic2020-02-17Paper
Equational closure and closure with respect to enumeration on a set of partial multivalued logic functions2020-01-20Paper
Extensions of the Positive Closure Operator by Using Logical Connectives2019-12-02Paper
On the complexity of polynomial recurrence sequences2019-07-19Paper
Calculating the number of functions with a given endomorphism2019-03-28Paper
Computations on counter machines with summator2018-10-10Paper
Basic positively closed classes in three-valued logic2018-09-03Paper
Bounded prefix concatenation operation and finite bases with respect to the superposition2018-04-23Paper
On the operations of bounded suffix summation and multiplication2018-04-06Paper
On FE-precomplete classes in countable-valued logic2017-11-02Paper
Closure operators with positive connectives and quantifiers2017-07-18Paper
On maximal subalgebras of the algebras of unary recursive functions2017-02-09Paper
On maximal subgroups of the group of recursive permutations2016-11-22Paper
On elementary word functions obtained by bounded prefix concatenation2016-09-13Paper
Closed classed of three-valued logic that contain essentially multiplace functions2016-09-13Paper
https://portal.mardi4nfdi.de/entity/Q31868242016-08-12Paper
Functional equations for the functions of real variables2016-04-05Paper
On complexity of problem of satisfiability for systems of countable-valued functional equations2016-01-14Paper
On the enumeration closure operator in multivalued logic2015-11-13Paper
On a recursive definition of a class of finite automaton functions2015-09-04Paper
Complexity of the search for the least solution to a system of dictionary equations of exponential type2015-07-30Paper
Positively closed classes of three-valued logic2015-07-27Paper
https://portal.mardi4nfdi.de/entity/Q52637842015-07-17Paper
On maximal and minimal elements of partially ordered sets of Boolean degrees2015-07-17Paper
Definability in the language of functional equations of a countable-valued logic2015-05-12Paper
Bounded monotone recursion and multihead automata2015-03-23Paper
The FE-closure operator in countable-valued logic2013-11-28Paper
Interpolation and superpositions of multivariate continuous functions2013-07-08Paper
Definition of positively closed classes by endomorphism semigroups2013-06-24Paper
Atoms of the lattice of positively closed classes of three-valued logic2013-04-29Paper
Mixed id-expansion of multivalued logic functions2012-11-20Paper
FE classification of functions of many-valued logic2012-11-20Paper
Iteration operators on a set of continuous functions of Baire space2012-11-20Paper
On orders of closed classes containing a homogeneous switching function2012-11-20Paper
Operator of positive closure2012-05-10Paper
Positively closed classes of three-valued logic generated by one-place functions2012-03-23Paper
Complete and incomplete Boolean degrees2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31152032012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152242012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152752012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31155972012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156062012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156452012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156792012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157132012-02-10Paper
The uniform id-decomposition of functions of many-valued logic over homogeneous functions2011-05-10Paper
https://portal.mardi4nfdi.de/entity/Q30639912010-12-18Paper
On the complexity of the ℰ2 Grzegorczyk class2010-09-06Paper
Superpositions of continuous functions defined on a Baire space2010-03-16Paper
Solutions to the systems of functional equations of multivalued logic2010-01-29Paper
Orders of discriminator classes in multivalued logic2010-01-12Paper
On solutions to systems of functional equations of multiple-valued logic2009-10-26Paper
The closure operator with the equality predicate branching on the set of partial Boolean functions2009-10-21Paper
https://portal.mardi4nfdi.de/entity/Q36235642009-04-21Paper
https://portal.mardi4nfdi.de/entity/Q36167502009-03-26Paper
https://portal.mardi4nfdi.de/entity/Q36152152009-03-18Paper
Positively closed classes of partial Boolean functions2009-01-26Paper
Iteration of Boolean \((n,n)\)-operators2009-01-20Paper
Strong closure operators on the set of partial Boolean functions2008-10-27Paper
https://portal.mardi4nfdi.de/entity/Q54454202008-03-05Paper
On the structure of equationally closed classes2007-11-02Paper
The equational closure operator2007-10-22Paper
https://portal.mardi4nfdi.de/entity/Q53076372007-09-18Paper
On the cardinality of the family of precomplete classes in \(P_{E}\)2006-10-20Paper
Equational closure2006-10-10Paper
On the structure of partially ordered sets of Boolean degrees2006-10-10Paper
Toxicology of nanoparticles2006-07-18Paper
https://portal.mardi4nfdi.de/entity/Q33729572006-03-10Paper
https://portal.mardi4nfdi.de/entity/Q46754622005-05-04Paper
On the polynomial computability of some rudimentary predicates.2004-12-02Paper
On the complexity of computation of rudimentary predicates2004-08-30Paper
Clones determined by alternating monoids2004-08-30Paper
On the complexity of recurring sequences2004-08-30Paper
Boolean reducibility2004-08-30Paper
https://portal.mardi4nfdi.de/entity/Q31484882002-10-06Paper
Impossibility of constructing continuous functions of $ (n+1)$ variables from functions of $ n$ variables by means of certain continuous operators2002-06-02Paper
https://portal.mardi4nfdi.de/entity/Q27820302002-04-12Paper
\(A\)-closed classes of idempotent functions of many-valued logic definable by binary relations2002-01-30Paper
On expressibility of functions of many-valued logic in some logical-functional languages2001-12-18Paper
https://portal.mardi4nfdi.de/entity/Q27551422001-11-08Paper
Functional aspects of the completeness problem for some classes of automaton functions2001-08-16Paper
The S-classification of functions of many-valued logic2001-05-10Paper
A-closed classes of many-valued logic containing constants2001-05-10Paper
\(A\)-classification of functions of many-valued logic2001-01-28Paper
On Slupecki classes for automaton functions2001-01-04Paper
https://portal.mardi4nfdi.de/entity/Q45209032000-12-18Paper
On superpositions of continuous functions defined on the Baire space2000-10-16Paper
https://portal.mardi4nfdi.de/entity/Q49483302000-06-07Paper
A-classification of idempotent functions of many-valued logic2000-04-16Paper
https://portal.mardi4nfdi.de/entity/Q42090531999-09-29Paper
https://portal.mardi4nfdi.de/entity/Q42422991999-05-10Paper
Clone classification of dually discriminator algebras with finite support1999-03-23Paper
The \(S\)-classification of idempotent algebras with a finite support1998-06-11Paper
Basic relations of the S-classification of functions of the multi-valued logic1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q48663521996-03-20Paper
On precomplete classes in Cartesian products of P 2 and P 31995-05-22Paper
https://portal.mardi4nfdi.de/entity/Q33643121995-01-01Paper
On the id-decompositions of the class P k over precomplete classes1994-09-08Paper
On the Slupecki classes in the systems Pk x ... x Pl1994-09-07Paper
On the uniform id-decomposability of Boolean functions1994-04-19Paper
https://portal.mardi4nfdi.de/entity/Q42785491994-03-13Paper
On the completeness in the System P 3 x P 31993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40016971992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q39872311992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39808111992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39708781992-06-25Paper
Existence of infinite bases with respect to superposition in certain classes of one-place functions1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31994071990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34768001990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963761990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34899851989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963851989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38290751988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47311761988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117071988-01-01Paper
Existence of superposition bases in countable primitively recursively closed classes1986-01-01Paper
Existence of finite bases in closed classes of Boolean functions1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36632611983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47458131982-01-01Paper
The complexity of computing exponents1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36616401982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36669061982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36996811982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297881981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39373701981-01-01Paper
Complexity of algorithms and computations1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30393141981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808221980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39226781980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39226791980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39268091980-01-01Paper
Existence of superposition bases in countable primitive-recursively closed classes of one-place functions1980-01-01Paper
A superposition basis in the class of Kalmar elementary functions1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38938971979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015041979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39015071979-01-01Paper
A method for constructing maximal subalgebras of algebras of general recursive functions1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41387211977-01-01Paper
ON RECURSIVELY ENUMERABLE MINIMAL BTT-DEGREES1977-01-01Paper
On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers1976-01-01Paper
The existence of recursively enumerable minimal truth-tabular degrees1976-01-01Paper
Tabular powers of maximal sets1976-01-01Paper
One class of partial sets1976-01-01Paper
Elementary Skolem functions1975-01-01Paper
The computable enumerations of families of general recursive functions1974-01-01Paper
Existence of families without positive numerations1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56728841972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40634231971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56540311971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56684591971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56728831970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55823391969-01-01Paper
Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sergey S. Marchenkov