Abstract
The synthesis problem in switching theory, that is, th e problem of designing a circuit from given building blocks, has led since the 1950s to an extensive study of the decomposition of truth functions (usually referred to as Boolean functions). Roughly speaking, this problem consists in expressing an arbitrary truth function by means of other (convenient) truth functions. In BFE, Chapter 16, §1, we have reported a few methods and results in this line of research. We strongly suggest that this field deserves a separate monograph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Rudeanu, S. (2001). Decomposition of Boolean functions. In: Lattice Functions and Equations. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0241-0_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0241-0_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-266-2
Online ISBN: 978-1-4471-0241-0
eBook Packages: Springer Book Archive