Abstract
AbstractWe describe sets of partial Boolean functions being closed under the operations of superposition. For any class A of total functions we define the set 𝔐(A) consisting of all partial classes which contain precisely the functions of A as total functions. The cardinalities of such sets 𝔐(A) can be finite or infinite. We state some general results on 𝔐(A). In particular, we describe all 30 closed sets of partial Boolean functions which contain all monotone and zero‐preserving total Boolean functions.
Sign-in/Register to access full text options 
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.
