Logical Statements
A statement (or proposition) is a sentence that is definitely either true or false — never both, never neither. "12 is divisible by 4" is a statement; "Solve this!" and "Is it raining?" are not. The negation ¬p flips the truth value: the negation of "all CAT toppers study daily" is NOT "no CAT topper studies daily" but the weaker "at least one CAT topper does not study daily". Compound statements join simple ones with connectives: AND (∧) demands both parts, OR (∨) is inclusive and demands at least one. The CAT-relevant skill is reading everyday English into logic precisely — "but", "yet" and "although" are all AND; "unless" usually means "if not". When you negate a compound statement use De Morgan: ¬(p ∧ q) becomes ¬p ∨ ¬q, and ¬(p ∨ q) becomes ¬p ∧ ¬q. Getting the negation right is what separates a valid inference from a trap answer.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Connectives & negation
| Negation | ¬p is true exactly when p is false |
|---|---|
| Conjunction (AND) | p ∧ q true only when both p and q are true |
| Disjunction (OR) | p ∨ q false only when both p and q are false |
| Implication | p → q false only when p is true and q is false |
| Biconditional | p ↔ q true when p and q have the same truth value |
Logical identities (CAT power-tools)
| Contrapositive (equivalent) | (p → q) ≡ (¬q → ¬p) |
|---|---|
| Implication as OR | (p → q) ≡ (¬p ∨ q) |
| De Morgan (AND) | ¬(p ∧ q) ≡ ¬p ∨ ¬q |
| De Morgan (OR) | ¬(p ∨ q) ≡ ¬p ∧ ¬q |
| Negation of quantifiers | ¬(∀x P) ≡ ∃x ¬P; ¬(∃x P) ≡ ∀x ¬P |