Abstract
Solutions to the systems of functional Boolean equations are under study. For each of the classes P 2, T 0, T 1, S, T 01, and S 01, the problem is solved of constructing some systems of functional Boolean equations with a given set of functional constants and one functional variable whose unique solution is a given function of the class under consideration. For an arbitrary nonempty set F of n-argument Boolean functions, a system of equations with the functional constants ∨ and & is built with F as the solution set. If F is closed under transition to dual functions then the corresponding system can be constructed without functional constants.
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.
