Abstract
We consider the problem of characterizing sets of Boolean functions. Extending results of Ekin et al. and Pippenger, we show that a set of Boolean (or finite) functions can be characterized by a set of objects called ‘generalized constraints’ iff the set is closed under the operations of permutation of variables and addition of dummy variables. We show a relationship between sets of Boolean functions that are characterizable by a finite set of generalized constraints and sets of Boolean functions that have constant-size certificates of non-membership. We then explore whether certain particular sets of Boolean functions have constant-size certificates of non-membership; most notably, we show that the well-known set of Boolean threshold functions does not have constant-size certificates of non-membership. Finally, we extend results of Pippenger to develop a Galois theory for sets of Boolean functions closed under the operations of permutation of variables and addition of dummy variables.
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.
