Please help this is related to "Boolean Algebra".
Explain concept of “DUALITY” with example.
[ eg: solve this (a . b . c . d’ . e)’ ]
This is a discussion on Boolean algebra within the General Discussions forums, part of the Community Boards category; Please help this is related to "Boolean Algebra". Explain concept of “DUALITY” with example. [ eg: solve this (a . ...
Please help this is related to "Boolean Algebra".
Explain concept of “DUALITY” with example.
[ eg: solve this (a . b . c . d’ . e)’ ]
You can find help on this great site:
Let me topeka that for you
It never gets old.
I think that (a . b . c . d . e) should become (e . d . c . b. a) in fact it's just the opposite of the original order relation and it is a duality because it is a "transformation of the structure in itself in which you can find part of the notions related to it", (from my book of logic) in this case they are both order relations but the first is an ascending order <, while the second is descending >
Given a Boolean expression, its dual is formed by replacing '+' with '.' , '.' with '+', 0 with 1 or 1 with 0.
Given a boolean equation like x + 1 = 1, its dual is x . 0 = 0 and when you prove x + 1 = 1,
its dual follows 'By the Principle of Duality' and you don't need to prove x . 0 = 0
I think what you are looking for is the DeMorgan's Law where
(a . b . c . d’ . e)’ = a' + b' + c' + d + e'
But then i really don't know how do you "explain the concept of duality with an 'expression'."
The concept that you have explained is called "compliment". "Duality" is a different concept.
The definition of Duality is "Duality says that one part may be obtained from other if binary operators and identity elements are interchanged."
I hope this could help.
Regards
Akansha
Read up on DeMorgan's Law.