HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Statements, Connectives and Truth Tables
  1. 1Statements and their negations
  2. 2Connectives and truth tables
  3. 3Tautologies, equivalence and switching circuits
  1. Mathematics
  2. /Statements, Connectives and Truth Tables
  3. /Tautologies, equivalence and switching circuits

Course 36.1·Lesson 3 of 3

Tautologies, equivalence and switching circuits

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≡qp \equiv qp≡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
Statements, Connectives and Truth Tables
  1. 1Statements and their negations
  2. 2Connectives and truth tables
  3. 3Tautologies, equivalence and switching circuits

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∨∼pp \vee \sim pp∨∼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∧∼pp \wedge \sim pp∧∼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≡BA \equiv BA≡B.

A second way to say it: A≡BA \equiv BA≡B exactly when "AAA if and only if BBB" 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,\displaystyle \sim(p \wedge q) \equiv \sim p \vee \sim q,∼(p∧q)≡∼p∨∼q,
∼(p∨q)≡∼p∧∼q.\displaystyle \sim(p \vee q) \equiv \sim p \wedge \sim 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.

ppp, qqq∼(p∧q)\sim(p \wedge q)∼(p∧q)∼p∨∼q\sim p \vee \sim q∼p∨∼q
T, TFF
T, FTT
F, TTT
F, FTT

The columns agree, so the statements are equivalent.

The laws of the algebra of statements

Here T\mathrm{T}T is a statement that is always true and F\mathrm{F}F one that is always false. Each law can be checked with a truth table.

  • Idempotent: p∧p≡pp \wedge p \equiv pp∧p≡p and p∨p≡pp \vee p \equiv pp∨p≡p.
  • Commutative: p∧q≡q∧pp \wedge q \equiv q \wedge pp∧q≡q∧p and p∨q≡q∨pp \vee q \equiv q \vee pp∨q≡q∨p.
  • Associative: (p∧q)∧r≡p∧(q∧r)(p \wedge q) \wedge r \equiv p \wedge (q \wedge r)(p∧q)∧r≡p∧(q∧r), and the same for ∨\vee∨.
  • Distributive: p∧(q∨r)≡(p∧q)∨(p∧r)p \wedge (q \vee r) \equiv (p \wedge q) \vee (p \wedge r)p∧(q∨r)≡(p∧q)∨(p∧r).
  • Distributive, the other way: p∨(q∧r)≡(p∨q)∧(p∨r)p \vee (q \wedge r) \equiv (p \vee q) \wedge (p \vee r)p∨(q∧r)≡(p∨q)∧(p∨r).
  • Identity: p∧T≡pp \wedge \mathrm{T} \equiv pp∧T≡p and p∨F≡pp \vee \mathrm{F} \equiv pp∨F≡p.
  • Domination: p∨T≡Tp \vee \mathrm{T} \equiv \mathrm{T}p∨T≡T and p∧F≡Fp \wedge \mathrm{F} \equiv \mathrm{F}p∧F≡F.
  • Complement: p∨∼p≡Tp \vee \sim p \equiv \mathrm{T}p∨∼p≡T and p∧∼p≡Fp \wedge \sim p \equiv \mathrm{F}p∧∼p≡F.
  • Absorption: p∨(p∧q)≡pp \vee (p \wedge q) \equiv pp∨(p∧q)≡p and p∧(p∨q)≡pp \wedge (p \vee q) \equiv pp∧(p∨q)≡p.
  • De Morgan: as above.

Simplifying a statement

Simplify (p∧q)∨(p∧∼q)(p \wedge q) \vee (p \wedge \sim q)(p∧q)∨(p∧∼q).

  1. Distributive law, read backwards: it is p∧(q∨∼q)p \wedge (q \vee \sim q)p∧(q∨∼q).
  2. Complement: q∨∼q≡Tq \vee \sim q \equiv \mathrm{T}q∨∼q≡T, so it is p∧Tp \wedge \mathrm{T}p∧T.
  3. Identity: p∧T≡pp \wedge \mathrm{T} \equiv pp∧T≡p.

So the whole statement says no more than ppp. Check one row: with ppp true and qqq false, the second bracket is true, so the statement is true, like ppp.

The dual of a statement

Swap every ∧\wedge∧ with ∨\vee∨, and every T\mathrm{T}T with F\mathrm{F}F. The result is the dual. The dual of p∨(q∧T)p \vee (q \wedge \mathrm{T})p∨(q∧T) is p∧(q∨F)p \wedge (q \vee \mathrm{F})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 ∼\sim∼ stays where it is.

Switching circuits

A switch is closed or open, like a statement that is true or false. Let the statement ppp say "switch PPP 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∧qp \wedge qp∧q.
  • Two switches in parallel: current flows if at least one is closed. That is p∨qp \vee qp∨q.
  • A switch P′P'P′ that is always open when PPP is closed, and closed when PPP is open, gives ∼p\sim p∼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 PPP and QQQ in series, the statement p∧qp \wedge qp∧q. The second has them in parallel, p∨qp \vee qp∨q. The third has two branches in parallel: one branch is PPP and QQQ in series, the other is PPP and Q′Q'Q′ in series. Its statement is (p∧q)∨(p∧∼q)(p \wedge q) \vee (p \wedge \sim q)(p∧q)∨(p∧∼q).

We just simplified that statement to ppp. So the third circuit does the same job as the single switch PPP. 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.

Read it first. Then run it. Which of the three pairs are equivalent?

1. Test the absorption law p or (p and q) against p.

2. Change kind(lambda p, q: p or not p) to test p and not p. What does it print?

Common mistakes

  • Forgetting to switch the connective. ∼(p∧q)\sim(p \wedge q)∼(p∧q) is ∼p∨∼q\sim p \vee \sim q∼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 ∧\wedge∧ with ∨\vee∨ and T\mathrm{T}T with F\mathrm{F}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≡BA \equiv BA≡B when the columns agree in every row.
  • ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q.
  • The dual of an equivalence is an equivalence.
  • Series is ∧\wedge∧ and parallel is ∨\vee∨.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Is (p∧q)∨∼p(p \wedge q) \vee \sim p(p∧q)∨∼p a tautology, a contradiction or a contingency?
  1. Use De Morgan to negate "The number is even or the number is greater than 101010".
  1. Simplify p∧(∼p∨q)p \wedge (\sim p \vee q)p∧(∼p∨q).
  1. Write the dual of (p∧T)∨∼q(p \wedge \mathrm{T}) \vee \sim q(p∧T)∨∼q.
  1. Switch PPP is in series with a block of QQQ and RRR 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.
No payment. You can leave at any time.

Problems (4)

Simplify the statement S: ∼(∼ p wedge q) wedge (p vee q) step by step, naming the law you use at…Hard · High School (11–12) · by StemPy Lab
Classify each statement as a tautology, a contradiction or a contingency…Hard · High School (11–12) · by StemPy Lab
An electrician finds a lamp wired through three branches in parallel…Advanced · High School (11–12) · by StemPy Lab
That was the last lessonBack to the course: take the test
← Statements, Connectives and Truth Tables
← Connectives and truth tablesNext →

Discussion (0)

Log in to join the discussion.

Loading…

1 simulation
1 practice question
1 Python program
5 questions to check yourself

This lesson is free to read. Enroll free to keep your place and take the tests.

Prove, using the laws of the algebra of statements and not a truth table, that ∼big(p vee (∼ p…Advanced · High School (11–12) · by StemPy Lab

Python Labs (1)

A tester for laws and circuitsPython Lab · by StemPy Lab

Question Sets (1)

Statements and Truth Tables: Check Your Understanding10 questions · by StemPy Lab

Notes (1)

Statements, Connectives and Truth Tables: Quick RevisionNote · by StemPy Lab