In discrete mathematics, logic forms the backbone of reasoning and problem-solving. The most basic unit of logic is a proposition. All logical operations—such as conjunction, disjunction, negation, and implication—are built upon propositions.
Understanding propositions is essential before studying more advanced logical concepts.
A proposition is a declarative statement that has a definite truth value, either True or False, but not both.
✔ Each of these statements is either true or false.
✔ These do not have definite truth values.
Propositions are often represented using symbols such as:
p, q, r, ...
Each variable represents a proposition with a truth value:
p = True or Falseq = True or FalseA simple proposition cannot be broken down into smaller parts.
Example:
p: It is rainingA compound proposition is formed by combining simple propositions using logical operators.
Examples:
p ∧ q
p ∨ q
¬p
p → q
p ↔ q
| Operator | Symbol | Meaning |
|---|---|---|
| Negation | ¬ |
NOT |
| Conjunction | ∧ |
AND |
| Disjunction | ∨ |
OR |
| Conditional | → |
IF...THEN |
| Biconditional | ↔ |
IF AND ONLY IF |
An important distinction:
x > 5x5 > 5 → FalseEvery proposition has exactly one truth value:
There is no ambiguity.
All logical expressions are built using propositions.
A proposition is a statement that is either true or false
Represented using variables like p, q
Two types:
Forms the basis of all logical operations
Must not be confused with: