A problem of completeness of S-sets of deterministic functions

DOI10.3103/S0027132208050094MaRDI QIDQ2513016zbMATH OpenOpenAlexFDO

Authors V. A. Buevich, M. A. Podkolzina

Publication date 2 February 2015

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132208050094

Mathematics Subject Classification ID

Operations and polynomials in algebraic structures, primal algebras (08A40) Formal languages and automata (68Q45)

Recommendations

• On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
• The completeness criterion for S-sets of determinate functions
• scientific article; zbMATH DE number 497612
• On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions
• The number of S-precomplete classes in the functional system P_k^

Cites work

• scientific article; zbMATH DE number 497612 (Why is no real title available?)
• scientific article; zbMATH DE number 3231913 (Why is no real title available?)
• The completeness criterion for S-sets of determinate functions

Cited in

(5)

• On completeness and A-completeness of S-sets of determinate functions containing all one-place determinate S-functions
• The completeness criterion for S-sets of determinate functions
• scientific article; zbMATH DE number 4105274 (Why is no real title available?)
• scientific article; zbMATH DE number 497612 (Why is no real title available?)
• A finite set of functions with an EXPTIME-complete composition problem

This page was built for publication: A problem of completeness of S-sets of deterministic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513016)