Title :
The completeness problem on the product of algebras of finite-valued logic
Author_Institution :
New York, USA
Abstract :
Gives a general completeness criterion for the arity-calibrated product PkxPm of the algebras of all functions of the k-valued and m-valued logics (k,m⩾2). The Galois connection between the lattice of subalgebras PkxPm and the lattice of subalgebras of the double-base invariant relations algebra (with operations of restricted first order calculus) is established. This is used to obtain a Slupecki type criterion for PkxPm and to solve the completeness problem in P kxPm (m⩾2)
Keywords :
many-valued logics; Galois connection; Galois-closed set; Slupecki type criterion; arity-calibrated; completeness problem; double-base invariant relation; finite-valued logic; product of algebras; subalgebras; Algebra; Calculus; Lattices; Logic functions; Production;
Conference_Titel :
Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on
Conference_Location :
Boston, MA
Print_ISBN :
0-8186-5650-6
DOI :
10.1109/ISMVL.1994.302202