The completeness problem in the function algebra of linear integer-coefficient polynomials
From MaRDI portal
Publication:2997863
DOI10.1515/DMA.2010.038zbMath1234.08006OpenAlexW2018950225MaRDI QIDQ2997863
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
Operations and polynomials in algebraic structures, primal algebras (08A40) Many-valued logic (03B50)
Related Items
Closed classes of polynomials modulo \(p^2\) ⋮ On the equality problem of finitely generated classes of exponentially-polynomial functions ⋮ Completeness criterion in class of exponential-polynomial functions
Cites Work
- Inductive representations of Boolean functions and the finite generation of the Post classes
- Existence of finite bases in closed classes of Boolean functions
- On decidability of the completeness problem for special systems of automaton functions
- On precomplete classes in Cartesian products of P 2 and P 3
- On some closed classes in partial two-valued logic
- Maximal subalgebras of algebras of partial multivalued logic functions
- A series of maximum subalgebras of direct products of algebras of finite-valued logics
- On the functional system ℘Σ
- On the Slupecki classes in the systems Pk x ... x Pl
- On the structure of the lattice of closed classes of polynomials
- The S-classification of functions of many-valued logic
- [https://portal.mardi4nfdi.de/wiki/Publication:4732445 Completeness of logical functions on a square and in the system Pk�P?]
- Efficient recognition of completeness of systems of automaton functions with complete Boolean part
- The structure and methods of generation of closed classes of graphs
- Completeness conditions for finite automata
