Preview

De Morgan's Theorem

Good Essays
Open Document
Open Document
485 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
De Morgan's Theorem
De Morgan’s laws
In formal logic, De Morgan's laws are rules relating the logical operators "and" and "or" in terms of each other via negation, namely:
(A U B)’=A’ ∩ B’
(A ∩ B)’=A’ U B’
The rules can be expressed in English as:
"The negation of a conjunction is the disjunction of the negations." and
"The negation of a disjunction is the conjunction of the negations."
The law is named after Augustus De Morgan (1806–1871) who introduced a formal version of the laws to classical propositional logic. De Morgan's formulation was influenced by algebraization of logic undertaken by George Boole, which later cemented De Morgan's claim to the find. Although a similar observation was made by Aristotle and was known to Greek and Medieval logicians (in the 14th century William of Ockham wrote down the words that would result by reading the laws out), De Morgan is given credit for stating the laws formally and incorporating them in to the language of logic. De Morgan's Laws can be proved easily, and may even seem trivial. Nonetheless, these laws are helpful in making valid inferences in proofs and deductive arguments.
Logic gates invert all inputs to a gate reverses that gate's essential function from AND to OR, or vice versa, and also inverts the output. So, an OR gate with all inputs inverted (a Negative-OR gate) behaves the same as a NAND gate, and an AND gate with all inputs inverted (a Negative-AND gate) behaves the same as a NOR gate. DeMorgan's theorems state the same equivalence in "backward" form: that inverting the output of any gate results in the same function as the opposite type of gate (AND vs. OR) with inverted inputs

De Morgan’s theorem is used to simplify a lot expression of complicated logic gates. For example, (A + (BC)')'. The parentheses symbol is used in the example.

_
The answer is A BC.

Let's apply the principles of DeMorgan's theorems to the simplification of a gate circuit:

As always, the first step in

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Logic gates

    • 1375 Words
    • 5 Pages

    Activity 6.3.2 Logic Gates Introduction A two-valued number system is the basis for all of the powerful computers and electronic devices in the world. Those two values are 0 and 1. Everything in the digital world is based on this binary system. While it seems very simple, the binary system is used to create the logic that dictates the actions of complex and simpler digital systems. But how do processors know what to do with all of those 0s and 1s Gates are used. Gates process the 0s and 1s and react based on how they are designed to function. When many gates are combined, computers can solve complex problems by using the logic set forth by the combination and order of the gates. Equipment Logic Gates presentation Gateway To Technology notebook Procedure You will decipher and create logic statements to compare conditions with outputs. Your instructor will present Logic Gates.ppt while you complete this document. Digital Signals Describe how digital signals are represented. The columns below represent 8 segments of time. Each time segment can hold a digital signal. Trace a wave pattern to represent the binary number 10001101. Complete the chart for the NOT Gate. SymbolFunction A logic gate that changes its input logic level to the opposite stateTruth Table A Y 0 1 1 0 Complete the chart for the AND Gate. SymbolFunction SHAPE MERGEFORMAT A logic circuit whose Inputs both 1 then, Output 1Truth Table A B Y 0 0 0 0 1 0 1 0 0 1 1 1 Logic Word Problem (Original Example) If I am hungry and it is 500 p.m., then I will eat dinner. In your GTT notebook, sketch a circuit diagram that behaves like an AND Gate using a battery, two switches, and an LED output. Complete the chart for the OR Gate. SymbolFunction SHAPE MERGEFORMAT A logic circuit when Either Input 1 then, Output 1Truth Table A B Y 0 0 0 0 1 1 1 0 1 1 1 1 Logic Word Problem (Original Example) In your GTT notebook, sketch a circuit diagram that behaves like an OR Gate using a battery, two switches,…

    • 1375 Words
    • 5 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Quiz Comp Archi

    • 438 Words
    • 3 Pages

    6) What are combinational logic gates? Please draw the symbol, circuit schematic and truth table for the following gates:…

    • 438 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Unit 5 PT1420

    • 959 Words
    • 7 Pages

    The OR operator takes two Boolean expressions as operands and creates a compound Boolean expression that is true when either of the sub-expressions is true. The following is an example of an If-Then statement that uses the OR operator:…

    • 959 Words
    • 7 Pages
    Good Essays
  • Good Essays

    Math Functions

    • 629 Words
    • 3 Pages

    0≤x≤1 zero is less than or equal to x is less than or equal to 1…

    • 629 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    ECT114 Week3 Homework

    • 1022 Words
    • 15 Pages

    Z is the output of a NAND gate. The Boolean operator for the NAND gate is , there should be an inversion bar over the entire expression, and the inputs are (A + B) and (C D). Refer to Chapter 3…

    • 1022 Words
    • 15 Pages
    Satisfactory Essays
  • Powerful Essays

    Dickson, J. (2010). Interpretation and coherence in legal reasoning. Stanford Encyclopedia of Philosophy. Retrieved from http://plato.stanford.edu/archives/Spr2010enteries/legal_reas_interpret/…

    • 2384 Words
    • 10 Pages
    Powerful Essays
  • Good Essays

    List the relational operators and logical operators that can be used to form a validation rule.…

    • 636 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Exam study guide

    • 1369 Words
    • 6 Pages

    4) It is not true that you are a day late and a dollar short. (Hint: Use De Morganʹs laws.)…

    • 1369 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Religion Quiz Test

    • 793 Words
    • 4 Pages

    identify the relationship between the given sets of propositions (contradictory, contrary, subaltern, subcontrary, obverse, converse, partial cotrapositive or full contrapositive ).…

    • 793 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    The expression 1 To 5 in the Case 1 To 5 clause specifies the range of numbers from ____.…

    • 595 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Boolean Search Operators

    • 1581 Words
    • 7 Pages

    • In this search, we will retrieve records in which AT LEAST ONE of the search terms is present. We are searching on the terms college and also university since documents containing either of these words might be relevant.…

    • 1581 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    laws were mostly influenced by the Old English common law. The concept of stare decisis was…

    • 836 Words
    • 4 Pages
    Good Essays
  • Better Essays

    Computer Architecture

    • 1307 Words
    • 6 Pages

    Arithmetic Logic Unit: - Carries out all the calculations on the data. Apart from operations like addition, subtraction etc, ‘greater than’, ‘less than’ etc would also be provided.…

    • 1307 Words
    • 6 Pages
    Better Essays
  • Satisfactory Essays

    Output and Decoder

    • 808 Words
    • 3 Pages

    1. (0.2 points) Problem 1.a.i and 1.b from Section 5.10. Assume that there is a small delay ∆ at each gate (from the input to the output).…

    • 808 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Coordinating Conjunction

    • 1267 Words
    • 6 Pages

    The squid eyeball stew is so thick that you can eat it with a fork or spoon.…

    • 1267 Words
    • 6 Pages
    Good Essays

Related Topics