Is Demorgan's Theorem Applicable to This Boolean Expression?

  • Thread starter Thread starter needhelp83
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary

Discussion Overview

The discussion centers around the applicability of DeMorgan's Theorem to specific Boolean expressions, with participants exploring simplifications and corrections to their approaches. The scope includes technical reasoning and mathematical manipulation of Boolean algebra.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant presents a series of transformations of a Boolean expression, ultimately arriving at the answer AB, but expresses uncertainty about the correctness of their steps.
  • Another participant identifies an error in the third step of the initial transformation but agrees with the final answer of AB.
  • A subsequent reply corrects the earlier mistake, adjusting the expression to include the correct terms and still arriving at AB.
  • Another participant introduces a different Boolean expression and questions the possibility of simplification using a Karnaugh map, specifically mentioning the use of exclusive or.
  • A follow-up post corrects the notation of the Boolean expression presented for simplification.
  • A participant requests suggestions for simplifying the corrected expression.

Areas of Agreement / Disagreement

Participants generally agree on the final answer being AB, but there is disagreement regarding the correctness of the intermediate steps and the approach to simplification of a different expression. The discussion remains unresolved regarding the simplification of the latter expression.

Contextual Notes

Participants have noted mistakes in the steps of the Boolean transformations, but the implications of these corrections and their impact on the overall simplification process are not fully resolved. The use of exclusive or in the context of the Karnaugh map remains uncertain.

Who May Find This Useful

This discussion may be useful for individuals interested in Boolean algebra, particularly those looking to understand the application of DeMorgan's Theorem and simplification techniques in digital logic design.

needhelp83
Messages
193
Reaction score
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
The third step is wrong, but you got the right answer.
 
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
 
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
 
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]
 
Any suggestions?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
7
Views
3K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 0 ·
Replies
0
Views
1K