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 p p p is false. The negation of ' x > a x > a x > a ' is ' x ≤ a x \le a x ≤ a '. Compound statements join simple statements with connectives. Connectives And: p ∧ q p \wedge q p ∧ q is true only when both are true. Or (inclusive): p ∨ q p \vee q p ∨ q is false only when both are false. Exclusive or: true when exactly one part is true. Rows: n n n simple statements give 2 n 2^n 2 n 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 ≡ T p \vee \sim p \equiv \mathrm{T} p ∨ ∼ p ≡ T and p ∧ ∼ p ≡ F p \wedge \sim p \equiv \mathrm{F} p ∧ ∼ p ≡ F . Absorption: p ∨ ( p ∧ q ) ≡ p p \vee (p \wedge q) \equiv p p ∨ ( 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 .
Distributive law. ( p ∧ ∼ p ) ∨ ( q ∧ ∼ p ) (p \wedge \sim p) \vee (q \wedge \sim p) ( p ∧ ∼ p ) ∨ ( q ∧ ∼ p ) . Complement. F ∨ ( q ∧ ∼ p ) \mathrm{F} \vee (q \wedge \sim p) F ∨ ( q ∧ ∼ p ) . Identity. ∼ p ∧ q \sim p \wedge q ∼ p ∧ q . It is true only when p p p is F and q q q 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 Negate ' y y y is less than 0 0 0 '. Stuck? Show a hint Show the answerWhen is p ∨ ∼ q p \vee \sim q p ∨ ∼ q false? Stuck? Show a hint Show the answerIs ( p ∧ q ) ∨ ∼ ( p ∧ q ) (p \wedge q) \vee \sim(p \wedge q) ( p ∧ q ) ∨ ∼ ( p ∧ q ) a tautology? Stuck? Show a hint Show the answerTwo switches in series are both needed for a lamp. Which connective is this? Stuck? Show a hint Show the answerHow many rows has a truth table with 4 4 4 simple statements? Stuck? Show a hint Show the answerSources NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14. OpenStax, Contemporary Mathematics , Chapter 2.