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
  1. Notes
  2. /Statements, Connectives and Truth Tables: Quick Revision
MathematicsAlso Computer Science

Statements, Connectives and Truth Tables: Quick Revision

A brief note on statements and negations, and, or and the exclusive or, truth tables, tautologies, equivalent statements, the laws of logic and switching circuits, with practice and questions.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Statements, Connectives and Truth Tables. Read it before a test. Try each question at the end before you open its answer.

Statements

  • A statement is true or false, but not both. Commands, questions, wishes, opinions and open sentences are not statements.
  • Negation: ∼p\sim p∼p is true exactly when ppp is false. The negation of 'x>ax > ax>a' is 'x≤ax \le ax≤a'.
  • Compound statements join simple statements with connectives.

Connectives

  • And: p∧qp \wedge qp∧q is true only when both are true.
  • Or (inclusive): p∨qp \vee qp∨q is false only when both are false.
  • Exclusive or: true when exactly one part is true.
  • Rows: nnn simple statements give 2n2^n2n rows.

Laws

  • De Morgan: ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q.
  • De Morgan: ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q.
  • 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).
  • 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.
  • Duality: swap ∧\wedge∧ and ∨\vee∨, and T\mathrm{T}T and F\mathrm{F}F.

Kinds of statement

  • Tautology: true in every row. Contradiction: false in every row. Contingency: both.
  • Equivalent: the same value in every row.

Switching circuits

  • Series is ∧\wedge∧, parallel is ∨\vee∨, and a switch that is always opposite is ∼\sim∼.

A worked example

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

  1. Distributive law. (p∧∼p)∨(q∧∼p)(p \wedge \sim p) \vee (q \wedge \sim p)(p∧∼p)∨(q∧∼p).
  2. Complement. F∨(q∧∼p)\mathrm{F} \vee (q \wedge \sim p)F∨(q∧∼p).
  3. Identity. ∼p∧q\sim p \wedge q∼p∧q. It is true only when ppp is F and qqq is T.

Practice with new numbers

A program to try

The program prints the columns of De Morgan's two laws side by side, and counts the true rows of a statement.

Read it first. Then run it. Do the two columns of each law agree in every row?

1. Change the last statement to (p or q) and not p. In how many rows is it true?

Mistakes to avoid

  • Negating to the opposite instead of 'not'.
  • Reading 'or' as exclusive when the question does not say so.
  • Keeping the connective when you use De Morgan's law.
  • Reading series as 'or'.

Check yourself

  1. Negate 'yyy is less than 000'.
  1. When is p∨∼qp \vee \sim qp∨∼q false?
  1. Is (p∧q)∨∼(p∧q)(p \wedge q) \vee \sim(p \wedge q)(p∧q)∨∼(p∧q) a tautology?
  1. Two switches in series are both needed for a lamp. Which connective is this?
  1. How many rows has a truth table with 444 simple statements?

Sources

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14.
  • OpenStax, Contemporary Mathematics, Chapter 2.
← All Notes
← Viewing Angles, Slopes and Moving Objects: Quick RevisionConditionals, Contrapositives and Quantifiers: Quick Revision →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. Statements
  2. Connectives
  3. Laws
  4. Kinds of statement
  5. Switching circuits
  6. A worked example
  7. Practice with new numbers
  8. A program to try
  9. Mistakes to avoid
  10. Check yourself
  11. Sources

Goes with the lesson

Tautologies, equivalence and switching circuitsStatements, Connectives and Truth Tables

More notes on this topic

  1. Valid Arguments and Methods of Proof: Quick Revision
  2. Conditionals, Contrapositives and Quantifiers: Quick Revision
All notes on this topic →