Abstract
In this chapter we consider methods for analyzing systems of Boolean equations. These methods are of central importance in Boolean reasoning. We first consider ways in which systems of Boolean equations may be related. In particular, we define consequents, antecedents, equivalents, and solutions of Boolean systems. We also discuss several processes useful for Boolean reasoning. Among such processes are the reduction of a system of equations to a single equivalent equation, the elimination of a variable from an equation, the detection of redundant variables in an interval, and the substitution of an expression for a variable in a Boolean formula.
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
© 1990 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brown, F.M. (1990). Boolean Analysis. In: Boolean Reasoning. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2078-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2078-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-2080-8
Online ISBN: 978-1-4757-2078-5
eBook Packages: Springer Book Archive