Contingency in Discrete Mathematics [ English ]

Languages

• English

1. Introduction to Contingency

In discrete mathematics, propositions are often classified based on their truth values across all possible cases. While some statements are always true (tautologies) and some are always false (contradictions), many statements fall in between. These are called contingencies.

A contingency represents a logical expression whose truth value depends on the values of its variables.

2. Definition of Contingency

A contingency is a compound proposition that is true for some truth values and false for others.

Formal Definition:

A proposition is called a contingency if it is neither always true nor always false.

3. Symbol and Representation

There is no specific symbol that represents contingency directly. Instead, a proposition is identified as a contingency by analyzing its truth table.

4. Truth Table of a Contingency

Consider the proposition:

p → q

Explanation:

• The result is true in some cases and false in others
• Therefore, p → q is a contingency

5. Examples of Contingency

Example 1: Conditional Statement

p → q

✔ Not always true ✔ Not always false → Hence, a contingency

Example 2: Conjunction

p ∧ q

✔ True in one case, false in others → Contingency

Example 3: Disjunction

p ∨ q

✔ True in some cases, false in one case → Contingency

Example 4: Using Predicates

Let:

• p(x): x > 0

This is a predicate, not a proposition.

Assign values:

• If x = 5 → True
• If x = -2 → False

✔ Since truth varies with input, it behaves like a contingency after instantiation across values.

6. Contingency vs Tautology vs Contradiction

7. Identifying a Contingency

A proposition is a contingency if:

• Its truth table contains at least one True and one False value

8. Importance of Contingency

(a) Logical Analysis

• Helps distinguish flexible statements from absolute ones

(b) Computer Science

• Used in condition evaluation
• Decision-making systems

(c) Mathematics

• Many real-world conditions are contingencies

9. Key Observations

• Most logical expressions are contingencies
• Only special forms become tautologies or contradictions
• Contingency depends on variable assignments

10. Summary

• A contingency is a proposition that is sometimes true and sometimes false

• It has mixed truth values in its truth table

• Examples include:

  • p → q
  • p ∧ q
  • p ∨ q

• It lies between:

  • Tautology (always true)
  • Contradiction (always false)