Abstract
Searching a condensed adequate set of k-valued logic is a challenging problem. Using algebraic expression of logical functions, a normal form for k-valued logic was presented in Cheng et al. [3]. Starting from the normal form, searching adequate set of k-valued logic is converted to searching set of generators of their isomorphic matrix group/semigroup. Two adequate sets of k-valued logic are revealed, which consist of only 4 logical operators: one binary and three unary operators. These two adequate sets are uniformly defined for all k≥3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
