The completeness problem in the function algebra of linear integer-coefficient polynomials

DOI10.1515/DMA.2010.038zbMATH Open1234.08006OpenAlexW2018950225MaRDI QIDQ2997863FDOQ2997863

Authors: Andrei I. Mamontov, Dmitry G. Meshchaninov 

Publication date: 10 May 2011

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2010.038

Recommendations

• scientific article; zbMATH DE number 1166297
• Relative completeness
• scientific article; zbMATH DE number 2099552
• The completeness problem in the class of polynomials is resolvable
• The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\)

zbMATH Keywords

completenesspolynomialsuperpositionclone

Mathematics Subject Classification ID

Many-valued logic (03B50) Operations and polynomials in algebraic structures, primal algebras (08A40)

Cites Work

• On some closed classes in partial two-valued logic
• A series of maximum subalgebras of direct products of algebras of finite-valued logics
• Existence of finite bases in closed classes of Boolean functions
• Maximal subalgebras of algebras of partial multivalued logic functions
• On decidability of the completeness problem for special systems of automaton functions
• Inductive representations of Boolean functions and the finite generation of the Post classes
• The structure and methods of generation of closed classes of graphs
• Completeness of logical functions on a square and in the system Pk�P?
• On the structure of the lattice of closed classes of polynomials
• On precomplete classes in Cartesian products of P 2 and P 3
• The S-classification of functions of many-valued logic
• On the Slupecki classes in the systems Pk x ... x Pl
• Completeness conditions for finite automata
• On the functional system ℘Σ
• Efficient recognition of completeness of systems of automaton functions with complete Boolean part

Cited In (7)

• Completeness criterion in class of exponential-polynomial functions
• The completeness problem in the class of polynomials is resolvable
• On the equality problem of finitely generated classes of exponentially-polynomial functions
• Title not available (Why is that?)
• Closed classes of polynomials modulo \(p^2\)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The completeness problem in the function algebra of linear integer-coefficient polynomials

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