Prof. Dr. Thorsten Jungmann (last updated 2026-10-13)
Relates to DET-02 Logic operations
Task
With the rules of Boolean algebra, you can transform logic expressions without drawing a circuit. Give all results in the notation of electrical engineering that the lesson uses. Subtasks b) and d) are based on exercises in the textbook by LaMeres [5, p. 146].
a) Write the following expressions in the notation of electrical engineering: from mathematics, !(A && B) || C from computer science and from mathematics.
b) Name the theorem of Boolean algebra that each of the following statements describes, and write it as an equation:
- (1) A variable combined with itself by OR yields the variable itself.
- (2) A variable that is negated twice yields the variable itself.
- (3) A variable combined with 1 by OR yields 1.
- (4) A variable that appears in several product terms can be factored out.
- (5) A term that another term of the expression already covers can be removed.
- (6) An AND gate with inverted inputs is equivalent to an OR gate with an inverted output.
c) Insert all parentheses into that show the order in which the expression is evaluated. Then evaluate for , and .
d) Prove with a proof by exhaustion that an AND gate with inverted inputs is equivalent to an OR gate with an inverted output: .
e) Prove with a truth table that . With OR, the distributive property has no counterpart in ordinary arithmetic.
f) Simplify step by step, and name the theorem that you use in each step.
g) Simplify step by step, and name the theorem that you use in each step.
h) Simplify step by step, and name the theorem that you use in each step.
Solution
a) ; ;
b) (1) idempotence, ; (2) involution, ; (3) null element, ; (4) distributive property, ; (5) absorption, ; (6) De Morgan’s laws,
c) ; for , and :
d) The columns and agree in all four rows.
e) The columns and agree in all eight rows.
f)
g)
h)
