The completeness problem in the function algebra of linear integer-coefficient polynomials
From MaRDI portal
Publication:2997863
Recommendations
Cites work
- A series of maximum subalgebras of direct products of algebras of finite-valued logics
- Completeness conditions for finite automata
- 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
- Existence of finite bases in closed classes of Boolean functions
- Inductive representations of Boolean functions and the finite generation of the Post classes
- Maximal subalgebras of algebras of partial multivalued logic 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
- On the Slupecki classes in the systems Pk x ... x Pl
- On the functional system ℘Σ
- On the structure of the lattice of closed classes of polynomials
- The S-classification of functions of many-valued logic
- The structure and methods of generation of closed classes of graphs
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
- scientific article; zbMATH DE number 1273643 (Why is no real title available?)
- Closed classes of polynomials modulo p^2
- scientific article; zbMATH DE number 3937717 (Why is no real title available?)
- scientific article; zbMATH DE number 1892907 (Why is no real title available?)
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)