Boolean Algebra optimization question

AI Thread Summary
The discussion revolves around optimizing a Boolean algebra equation using known laws rather than relying on Karnaugh maps. The consensus theorem is identified as the key principle that allows for this optimization, specifically transforming the equation from xy' + xz' + y'z to xz' + y'z. The user also notes the existence of multiple forms of the consensus theorem, confirming its validity through various sources, including a textbook and Wikipedia. This highlights the importance of understanding Boolean identities for simplification in algebraic expressions. Ultimately, the consensus theorem serves as a crucial tool for optimizing Boolean equations effectively.
FocusedWolf
Messages
81
Reaction score
0
Hi,

This is a question about a boolean "law" type behavior I've noticed in my homework a couple of times.

Basically i can't find a boolean algebra law that permits this optimization short of using a k-map.

bool.jpg


So I'm just wondering if theirs some way to optimize the one equation using just boolean algebra in order to get the second one (the output of the k-map).
 
Physics news on Phys.org
Nvm i found it in the solutions for that homework.

It's called the "consensus theorem"

where:

xy' + xz' +y'z =xz' + y'z

Had a feeling it was some obscure identity/law lol
 
Last edited:
OK apparently theirs two or more forms: xy + x'z + yz = xy + x'z

found this one in a book, and matched wikipedia.
 
Back
Top