Title :
Completeness theory for vector partial multiple-valued logic functions
Author_Institution :
New York, NY, USA
Abstract :
A general completeness criterion for the finite product ΠP (ki) of algebras P(ki) of all partial functions of ki-valued logic (ki⩾2, i=1,…n; n⩾2) is considered and a Galois connection between the lattice of subalgebras of ΠP(ki) and the lattice of subalgebras of multiple-base invariant relations algebra (with operations of a restricted quantifier free calculus) is established. This is used to obtain the full description of all maximal subalgebras of ΠP(ki) and, thus, to solve the completeness problem in ΠP(ki)
Keywords :
Algebra; Artificial intelligence; Calculus; Lattices; Logic functions; Parallel processing; Sufficient conditions;
Conference_Titel :
Multiple-Valued Logic, 1995. Proceedings., 25th International Symposium on
Conference_Location :
Bloomington, IN
Print_ISBN :
0-8186-7118-1
DOI :
10.1109/ISMVL.1995.513514