Day 04Part12-Concept of tautology contradiction and Contigency , Satisfiable and Unsatisfiable case.
Day 04Part12-Concept of tautology contradiction and Contigency, Satisfiable and Unsatisfiable case.
Contents [hide]
- 1 Day 04 – Part 12: Concept of Tautology, Contradiction, and Contingency
- 2 1. Tautology (सर्वदा सत्य / Always True)
- 3 2. Contradiction (सर्वदा असत्य / Always False)
- 4 3. Contingency (कभी सत्य, कभी असत्य / Sometimes True, Sometimes False)
- 5 4. Satisfiable and Unsatisfiable Cases
- 6 Summary
- 7 Day 04Part12-Concept of tautology contradiction and Contigency , Satisfiable and Unsatisfiable case.
- 8 Discrete Mathematics and Its Applications, Eighth Edition
- 9 1.3. Tautology /Contradiction / Contingency
- 10 1.3 Propositional Equivalences
- 11 DISCRETE MATHEMATICS
Day 04 – Part 12: Concept of Tautology, Contradiction, and Contingency
In Discrete Mathematics and Logic, statements can be categorized based on their truth values in all possible scenarios. The key concepts are Tautology, Contradiction, and Contingency, along with Satisfiable and Unsatisfiable cases.
1. Tautology (सर्वदा सत्य / Always True)
A tautology is a logical statement that is always true, regardless of the truth values of its individual components.
Example:
- p∨¬pp \lor \neg p (Law of Excluded Middle)
- “It will either rain or not rain.” (Always True)
Truth Table:
| pp | ¬p\neg p | p∨¬pp \lor \neg p |
|---|---|---|
| T | F | T |
| F | T | T |
Since the last column contains all True (T) values, it is a Tautology.
2. Contradiction (सर्वदा असत्य / Always False)
A contradiction is a logical statement that is always false, regardless of the truth values of its components.
Example:
- p∧¬pp \land \neg p (Self-Contradiction)
- “It is raining and not raining at the same time.” (Always False)
Truth Table:
| pp | ¬p\neg p | p∧¬pp \land \neg p |
|---|---|---|
| T | F | F |
| F | T | F |
Since the last column contains all False (F) values, it is a Contradiction.
3. Contingency (कभी सत्य, कभी असत्य / Sometimes True, Sometimes False)
A contingency is a logical statement that is sometimes true and sometimes false, depending on the values of its components.
Example:
- p∨qp \lor q (Logical OR between two statements)
Truth Table:
| pp | p∨qp \lor q | |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | T |
| F | F | F |
Since the last column has both True (T) and False (F) values, it is a Contingency.
4. Satisfiable and Unsatisfiable Cases
Satisfiable Statement:
- A proposition is satisfiable if it is true in at least one case.
- Example: p∨qp \lor q (It has at least one True in the truth table).
Unsatisfiable Statement:
- A proposition is unsatisfiable if it is never true (always false, i.e., contradiction).
- Example: p∧¬pp \land \neg p (Always False).
Summary
| Concept | Definition | Example |
|---|---|---|
| Tautology | Always True | p∨¬pp \lor \neg p |
| Contradiction | Always False | p∧¬pp \land \neg p |
| Contingency | Sometimes True, Sometimes False | p∨qp \lor q |
| Satisfiable | True in at least one case | p∨qp \lor q |
| Unsatisfiable | Never True (Always False) | p∧¬pp \land \neg p |
Would you like more examples or practical applications of these concepts?