Contradictions

Definition

A contradiction is a propositional statement that evaluates to false for every possible assignment of truth values to its variables.

If a proposition $P$ is a contradiction, then:

$$P \equiv \text{False}$$

Examples:

• $p \land \neg p$
• $(p \rightarrow q) \land (p \land \neg q)$
• $p \land \neg(p \lor q)$

These expressions can never be true because they contain mutually incompatible conditions.

Main Content

1. Logical Nature of Contradictions

• A contradiction represents an impossible situation in logic. It claims that something is true and false at the same time, which cannot happen under classical propositional logic.
• Contradictions are often identified using a truth table, where the final result is false in every row. For example:

This shows that $p \land \neg p$ is always false, so it is a contradiction.

• Contradictions are used to detect inconsistency in logical systems. If a set of premises leads to a contradiction, then the premises cannot all be true simultaneously.

2. Contradictions in Argument Testing

• In logic, contradictions help determine whether an argument is valid. One common method is proof by contradiction, where we assume the opposite of what we want to prove and show that it leads to a contradiction.
• Example: To prove that a number is not both even and odd at the same time, we use the fact that the statement “a number is even and not even” is contradictory.
• If assuming a conclusion false produces a contradiction, then the conclusion must be true. This is widely used in mathematics, computer science, and formal verification.
• Contradictions also reveal bad arguments. If premises force both a statement and its negation, then the argument or theory is inconsistent.

3. Relationship with Tautologies and Logical Equivalence

• Contradictions are the opposite of tautologies. A tautology is always true; a contradiction is always false.
• A statement $P$ is a contradiction if its negation $\neg P$ is a tautology.
• Example: $P = p \land \neg p$
• Then $\neg P$ is always true.
• Contradictions are useful for simplifying expressions using logical laws such as:
• Law of Non-Contradiction: $p \land \neg p \equiv F$
• De Morgan’s Laws
• Identity and Domination Laws
• In Boolean algebra, contradictions are used to reduce complex expressions and optimize logic circuits. For instance: $$(p \land q) \land (\neg p) \equiv F$$

Working / Process

1. Write the propositional statement

• Express the given condition using logical symbols such as $\land$, $\lor$, $\neg$, $\rightarrow$, and $\leftrightarrow$.
• Example: “It is raining and it is not raining” becomes $p \land \neg p$.

2. Construct the truth table or apply logical laws

• Check all possible truth values of the variables.
• If the final expression is false in every row, it is a contradiction.
• Alternatively, simplify using laws like:
  • $p \land \neg p = F$
  • $p \lor \neg p = T$

3. Use the contradiction to draw conclusions

• If a contradiction appears in premises, the set of premises is inconsistent.
• If contradiction appears during a proof, it can help establish the truth of the original claim.
• In logic and finite state machine analysis, contradictions help remove impossible states or transitions.

Advantages / Applications

• Helps identify invalid or inconsistent statements in arguments and proofs.
• Used in proof by contradiction, a powerful and widely accepted mathematical technique.
• Useful in Boolean simplification and digital circuit design to eliminate impossible conditions.
• Supports logical verification in computer science, formal methods, and finite state machine analysis by detecting unreachable or conflicting states.

Summary

• A contradiction is a statement that is always false.
• It occurs when a proposition and its negation are required to be true together.
• Contradictions are important for proving results, checking consistency, and simplifying logic.
• They are a foundational idea in propositional logic and help in analyzing impossible conditions in systems.