Abstract
The theory of Boolean functions and equations involve certain fundamental concepts, among which are those of minterm, prime implicant, reproductive solution and solution by recurrent inequalities. In this chapter we introduce and study certain notions which generalize the above ones. As a matter of fact, the challenge was to obtain the most general concepts which retain the main features of the concepts mentioned above.
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). A revision of Boolean fundamentals. In: Lattice Functions and Equations. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0241-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0241-0_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-266-2
Online ISBN: 978-1-4471-0241-0
eBook Packages: Springer Book Archive