Abstract

We give a classification of dual functions, they are m-al functions. We call a function m-al with respect to an operator if the operator lives any function unchanged after m times of using the operator. And 2 ≤ m ≤ k. Functions with different m have very different properties. We give theoretical results for clones of self-dual (m = 2) and self- -al (m = k) functions in k-valued logic at k ≤ 3. And we give numerical results for clones of self-dual and self-3-al functions in 3-valued logic. In particular, the inclusion graphs of clones of self-dual and of self-3-al functions are not a lattice.

Highlights

  • Multi-valued logic attracts intensive attention because of the connection with computer technology

  • We find the numbers of relations preserved by dual and k -al functions

  • A clone can belong to several clones

Read more

Summary

Introduction

Multi-valued logic attracts intensive attention because of the connection with computer technology. Lau [3], some self-3-al clones were found by S. More complete set of self-3-al clones is given in the article. The set of monotone clones was investigated by Machida [6]. We build the inclusion graphs of clones of self-dual and 3 -al functions and find properties of the functions. The letter k is used for values of logics only. The letter n is used for numbers of variables of functions only. The letter b is used as a value of variables. The letter l is used as values of functions. We use Boolean projections of functions if values of functions are 0 or 1 whenever values of variables are 0 or 1. We use sign “;" to separate values of variables from values of functions in lines of tables of functions.

Classes of Compositions of Function
Family of Functions with the Same Diagonal
Classes and Families
Conditions of Functions
Classes and Conditions
Boolean Projections
Dual and M-Al Operators
Dual Operators
Self-Dual Functions
2.10. On K-al Operators
2.11. Self-K-Al Functions
Classification of Self-Dual Functions
Classification of Self-3-Al Functions
Conclusion

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 call

Disclaimer: 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.