Abstract
It is shown in the literature (using the Post—Yablonsky theorem) that a complete set of Boolean operations cannot have a cardinal number greater than four. It is the object of this paper to improve this bound and prove that a complete set can have a cardinal number of at most three or, in other words, there does not exist a complete (non–redundant) set of more than three Boolean operations. The proof given here is constructive, using the Post—Yablonsky theorem, truth tables and combinatorial set theory.
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.
