Is Demorgan's Theorem Applicable to This Boolean Expression?

  • Thread starter needhelp83
  • Start date
  • Tags
    Theorem
In summary, the conversation is about simplifying the equation \overline{ \overline{A}+ \overline{B} + \overline{A}B } using a K-map and exclusive or. The correct answer is AB. There was a mistake in the third step of the simplification process, but it was corrected. The conversation also mentions another equation, (\overline{A1}*\overline{A0}*\overline{B1}*\overline{B 0}) + \overline{A1}A0\overline{B1}B0 + A1\overline{A0}B1\overline{B0} + A1A0
  • #1
needhelp83
199
0
[tex]\overline{ \overline{A}+ \overline{B} + \overline{A}B }[/tex]

[tex]\overline{ \overline{A}+ \overline{B} } * \overline{ \overline{A}B }[/tex]

[tex]\overline{ \overline{A}}* \overline{\overline{B} } * (\overline{ \overline{A}}+\overline{\overline{B }})[/tex]

[tex]AB(A + \overline{B}) [/tex]

[tex]AAB + AB\overline{B} [/tex]

ANSWER=AB

Just wanted to check. I haven't done this in a while
 
Physics news on Phys.org
  • #2
The third step is wrong, but you got the right answer.
 
  • #3
I see the mistake. It should be:

[tex]\overline{ \overline{A}}* \overline{\overline{B}} * (\overline{ \overline{A}}+\overline{B})[/tex]

[tex]AB(A + \overline{B}) [/tex]

[tex]AAB + AB\overline{B} [/tex]

[tex](A)B + A(0) [/tex]

[tex]AB[/tex]

Thanks for pointing that out
 
  • #4
I put this equation in a K-map and I was unable to simplify it. Is there anyway to do this with exclusive or? Thanks for the help

\overline{A1}\overline{A0}\overline{B1}\overline{B0} + \overline{A1}A0\overline{B1}B0 +
A1\overline{A0}B1\overline{B0} + A1A0B1B0
 
  • #5
Oops the equation should go as follows:

[tex](\overline{A1}*\overline{A0}*\overline{B1}*\overline{B 0}) + \overline{A1}A0\overline{B1}B0 + A1\overline{A0}B1\overline{B0} + A1A0B1B0 [/tex]
 
  • #6
Any suggestions?
 

What is Demorgan's Theorem?

Demorgan's Theorem is a mathematical concept that states that the negation of a logical statement can be rewritten as the opposite logical operation on each individual component of the statement.

What are the two versions of Demorgan's Theorem?

The two versions of Demorgan's Theorem are the DeMorgan's Law of Negation and the DeMorgan's Law of Conjunction.

How is Demorgan's Theorem used in boolean algebra?

Demorgan's Theorem is used in boolean algebra to simplify logical expressions by converting them into equivalent expressions with fewer terms or operations.

What are some practical applications of Demorgan's Theorem?

Demorgan's Theorem has many practical applications in fields such as computer science, electrical engineering, and digital logic design. It is used to simplify boolean expressions in circuit design, programming, and database queries.

Can Demorgan's Theorem be extended to more than two components?

Yes, Demorgan's Theorem can be extended to any number of components. This is known as the generalized Demorgan's Theorem and is often used in digital logic design with multiple inputs and outputs.

Similar threads

  • Introductory Physics Homework Help
Replies
7
Views
982
  • Precalculus Mathematics Homework Help
Replies
7
Views
2K
  • Introductory Physics Homework Help
Replies
9
Views
134
  • Engineering and Comp Sci Homework Help
Replies
2
Views
2K
Replies
5
Views
1K
  • Topology and Analysis
Replies
2
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
919
  • Set Theory, Logic, Probability, Statistics
Replies
13
Views
3K
  • Engineering and Comp Sci Homework Help
Replies
1
Views
2K
Back
Top