Tautology and Contradiction

Tautology and Contradiction problems involve identifying statements that are always true (tautologies) or always false (contradictions) regardless of the truth values of their component propositions. Examples include p ∨ ¬p (tautology) and p ∧ ¬p (contradiction).

10Worksheets
200+Practice Questions
MediumDifficulty
2-3 hoursHours to Master

Introduction to Tautology and Contradiction

Tautology and Contradiction problems involve identifying statements that are always true (tautologies) or always false (contradictions) regardless of the truth values of their component propositions. Examples include p ∨ ¬p (tautology) and p ∧ ¬p (contradiction).

Prerequisites

Truth table construction Basic connectives Logical necessity concept Contradiction detection
Why This Matters: Tautology/Contradiction problems appear in 1-2 questions in SSC CGL and Banking PO exams. They test understanding of logical necessity and impossibility.

How to Solve Tautology and Contradiction Problems

1

Step 1: Construct a truth table for the given expression

2

Step 2: Examine the output column for all input combinations

3

Step 3: If all outputs are True → Tautology

4

Step 4: If all outputs are False → Contradiction

5

Step 5: If outputs are mixed → Contingent (neither)

6

Step 6: For simple expressions, use known logical laws

7

Step 7: Present the classification

Pro Strategy: A tautology is true in every possible scenario. A contradiction is false in every possible scenario. Use truth tables for definitive classification.

Example Problem

Example: Is p ∨ ¬p a tautology, contradiction, or contingent? Solution: Step 1: Truth table: p=T → ¬p=F → T∨F=T; p=F → ¬p=T → F∨T=T Step 2: All outputs are True Step 3: Therefore, p ∨ ¬p is a tautology Answer: Tautology

Pro Tips & Tricks

  • p ∨ ¬p: Law of Excluded Middle (tautology)
  • p ∧ ¬p: Law of Non-Contradiction (contradiction)
  • p → p is a tautology (self-implication)
  • p ↔ p is a tautology (self-biconditional)
  • Any expression that is always true regardless of inputs is a tautology
  • Any expression that is always false regardless of inputs is a contradiction

Shortcut Methods to Solve Faster

If an expression can be simplified to p ∨ ¬p, it's a tautology
If an expression can be simplified to p ∧ ¬p, it's a contradiction
p → p ≡ T (tautology)
p ↔ ¬p ≡ F (contradiction)
A tautology's negation is a contradiction

Common Mistakes to Avoid

Classifying a contingent statement as tautology or contradiction
Forgetting to check all input combinations
Assuming an expression is tautology without verification
Confusing tautology with logical equivalence

Exam Importance

Tautology and Contradiction is an important topic for various competitive exams. Here's how frequently it appears:

SSC CGL
1-2 questions
BANKING PO
1-2 questions
RAILWAYS RRB
1-2 questions
CAT
1-2 questions
GMAT
1-2 questions
INSURANCE
1-2 questions

Ready to Master Tautology and Contradiction?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now