A tautology is true in every row of its truth table and a contradiction is false in every row; any other statement is a contingency. Two statements are equivalent, p≡q, when their columns agree. De Morgan's laws, the distributive, identity, complement and absorption laws simplify statements, and the dual of a law is a law. In a switching circuit, series is and, parallel is or.
about 25 min
Lesson 3 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
What you will be able to do
recognise a tautology, a contradiction and a contingency;
show that two statements are equivalent;
simplify a statement with De Morgan's laws and the other laws;
write the statement of a switching circuit, and simplify the circuit.
Always true, never true
Look at "It is raining or it is not raining". Whatever the weather, it is true. In symbols it is p∨∼p.
A tautology is a compound statement that is true in every row of its truth table.
A contradiction is false in every row. An example is p∧∼p.
A statement that is true in some rows and false in others is a contingency.
The negation of a tautology is a contradiction. The negation of a contradiction is a tautology.
Equivalent statements
Two statements are logically equivalent when they have the same truth value in every row. We write A≡B.
A second way to say it: A≡B exactly when "A if and only if B" is a tautology. You meet "if and only if" in the next course.
De Morgan's laws are the two equivalences you will use most:
∼(p∧q)≡∼p∨∼q,
∼(p∨q)≡∼p∧∼q.
In words: to negate an "and", negate each part and change to "or". To negate an "or", negate each part and change to "and".
Example. Negate "The shop is open and the lift is working". By De Morgan, the negation is "The shop is not open or the lift is not working".
You checked the second law with a truth table in the last lesson. Check the first one now, row by row.
p, q
∼(p∧q)
∼p∨∼q
T, T
F
F
T, F
T
T
F, T
T
T
F, F
T
T
The columns agree, so the statements are equivalent.
The laws of the algebra of statements
Here T is a statement that is always true and F one that is always false. Each law can be checked with a truth table.
Idempotent:p∧p≡p and p∨p≡p.
Commutative:p∧q≡q∧p and p∨q≡q∨p.
Associative:(p∧q)∧r≡p∧(q∧r), and the same for ∨.
Distributive:p∧(q∨r)≡(p∧q)∨(p∧r).
Distributive, the other way:p∨(q∧r)≡(p∨q)∧(p∨r).
Identity:p∧T≡p and p∨F≡p.
Domination:p∨T≡T and p∧F≡F.
Complement:p∨∼p≡T and p∧∼p≡F.
Absorption:p∨(p∧q)≡p and p∧(p∨q)≡p.
De Morgan: as above.
Simplifying a statement
Simplify (p∧q)∨(p∧∼q).
Distributive law, read backwards: it is p∧(q∨∼q).
Complement:q∨∼q≡T, so it is p∧T.
Identity:p∧T≡p.
So the whole statement says no more than p. Check one row: with p true and q false, the second bracket is true, so the statement is true, like p.
The dual of a statement
Swap every ∧ with ∨, and every T with F. The result is the dual. The dual of p∨(q∧T) is p∧(q∨F).
The principle of duality says: if two statements are equivalent, so are their duals. That is why the laws above come in pairs. The negation sign ∼ stays where it is.
Switching circuits
A switch is closed or open, like a statement that is true or false. Let the statement p say "switch P is closed". A lamp glows when current can flow from one end of the circuit to the other.
Two switches in series: current flows only if both are closed. That is p∧q.
Two switches in parallel: current flows if at least one is closed. That is p∨q.
A switch P′ that is always open when P is closed, and closed when P is open, gives ∼p.
Three switching circuits, each between a battery and a lamp. The first has switches P and Q one after the other in a single wire, labelled series, p and q. The second has P and Q on two wires side by side, labelled parallel, p or q. The third has two wires side by side: the upper wire has P then Q, and the lower wire has P then Q prime. It is labelled (p and q) or (p and not q).
The picture shows three circuits. The first has P and Q in series, the statement p∧q. The second has them in parallel, p∨q. The third has two branches in parallel: one branch is P and Q in series, the other is P and Q′ in series. Its statement is (p∧q)∨(p∧∼q).
We just simplified that statement to p. So the third circuit does the same job as the single switch P. Fewer switches, same lamp.
Practise with new numbers
Try it in Python
The program tests two statements on all the rows and says whether they are equivalent. It also says whether a statement is a tautology, a contradiction or a contingency.
Common mistakes
Forgetting to switch the connective.∼(p∧q) is ∼p∨∼q, with "or".
Calling a contingency a contradiction. A contradiction must be false in every row, not just in some.
Dualising the negation sign. The dual swaps ∧ with ∨ and T with F only.
Reading series as "or". Series needs every switch closed, so it is "and".
Remember these
Tautology: always T. Contradiction: always F. Contingency: both appear.
A≡B when the columns agree in every row.
∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q.
The dual of an equivalence is an equivalence.
Series is ∧ and parallel is ∨.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Is (p∧q)∨∼p a tautology, a contradiction or a contingency?
Use De Morgan to negate "The number is even or the number is greater than 10".
Simplify p∧(∼p∨q).
Write the dual of (p∧T)∨∼q.
Switch P is in series with a block of Q and R in parallel. Write the statement of the circuit.
References
NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14.
OpenStax, Contemporary Mathematics, Chapter 2, sections on equivalent statements and De Morgan's laws.
Enroll free in Statements, Connectives and Truth Tables
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.