Boolean algebra

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 . ...

  1. #1
    Registered User
    Join Date
    Apr 2010
    Posts
    2

    Boolean algebra

    Please help this is related to "Boolean Algebra".

    Explain concept of “DUALITY” with example.
    [ eg: solve this (a . b . c . d’ . e)’ ]

  2. #2
    Registered User claudiu's Avatar
    Join Date
    Feb 2010
    Location
    London, United Kingdom
    Posts
    2,094
    You can find help on this great site:

    Let me topeka that for you

    It never gets old.

  3. #3
    Registered User
    Join Date
    Nov 2009
    Location
    Italy
    Posts
    65
    Quote Originally Posted by akansha View Post
    Please help this is related to "Boolean Algebra".

    Explain concept of “DUALITY” with example.
    [ eg: solve this (a . b . c . d’ . e)’ ]
    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 >

  4. #4
    Registered User
    Join Date
    Mar 2009
    Posts
    48
    Quote Originally Posted by akansha View Post
    Please help this is related to "Boolean Algebra".

    Explain concept of “DUALITY” with example.
    [ eg: solve this (a . b . c . d’ . e)’ ]
    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'."

  5. #5
    Registered User
    Join Date
    Apr 2010
    Posts
    2
    Quote Originally Posted by zalezog View Post
    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

  6. #6
    Registered User
    Join Date
    Dec 2006
    Location
    Canada
    Posts
    3,145
    Read up on DeMorgan's Law.

  7. #7
    Registered User
    Join Date
    Mar 2009
    Posts
    48
    Quote Originally Posted by akansha View Post
    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."
    and i said
    Given a Boolean expression, its dual is formed by replacing '+' with '.' , '.' with '+', 0 with 1 or 1 with 0.
    Quote Originally Posted by akansha View Post
    I hope this could help.
    ?

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Boolean Algebra
    By Cyris in forum C++ Programming
    Replies: 12
    Last Post: 12-02-2010, 11:49 PM
  2. boolean algebra....urgent help needed!
    By Saimadhav in forum C++ Programming
    Replies: 1
    Last Post: 07-28-2008, 07:22 AM
  3. Looking for a Boolean Algebra site
    By Majin_Flack38 in forum A Brief History of Cprogramming.com
    Replies: 1
    Last Post: 11-21-2002, 11:03 AM
  4. Replies: 4
    Last Post: 05-03-2002, 09:40 PM
  5. pop quiz on boolean algebra
    By DavidP in forum A Brief History of Cprogramming.com
    Replies: 6
    Last Post: 09-27-2001, 07:11 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21