Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic: Richard Mayr
Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic: Richard Mayr
Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic: Richard Mayr
3:
Propositional Logic
Richard Mayr
University of Edinburgh, UK
1 Propositions
2 Logical Equivalences
3 Normal Forms
Constructing Propositions
Propositional Variables: p, q, r , s, . . .
The proposition that is always true is denoted by T and the
proposition that is always false is denoted by F.
Compound Propositions; constructed from logical connectives and
other propositions
Negation
Conjunction
Disjunction
Implication
Biconditional
p q p q
T T T
T F T
F T T
F F F
p q pq
T T T
T F F
F T F
F F F
if p, then q p implies q
if p, q p only if q
q unless p q when p
q if p q whenever p
p is sufficient for q q follows from p
q is necessary for p a necessary condition for p is q
a sufficient condition for q is p
p q p q
T T T
T F F
F T F
F F T
p q also reads as
p if and only if q
p iff q.
p is necessary and sufficient for q
if p then q, and conversely
p implies q, and vice-versa
Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.1-1.3 11 / 21
Precedence of Logical Operators
1
2
3
4
5
Thus p q r is equivalent to (p q) r .
If the intended meaning is p (q r ) then parentheses must be
used.
A proposition is
satisfiable, if its truth table contains true at least once. Example:
p q.
a tautology, if it is always true. Example: p p.
a contradiction, if it always false. Example: p p.
a contingency, if it is neither a tautology nor a contradiction.
Example: p.
Definition
Two compound propositions p and q are logically equivalent if the
columns in a truth table giving their truth values agree.
This is written as p q.
It is easy to show:
Fact
p q if and only if p q is a tautology.
(p q) p q
(p q) p q
p q p q (pq) (pq) pq
T T F F T F F
T F F T T F F
F T T F T F F
F F T T F T T
Domination laws: p T T, p F F
Identity laws: p T p, p F p
Idempotent laws: p p p, p p p
Double negation law: (p) p
Negation laws: p p T, p p F
The first of the Negation laws is also called law of excluded middle.
Latin: tertium non datur.
Commutative laws: p q q p, p q q p
Associative laws: (p q) r p (q r )
(p q) r p (q r )
Distributive laws: p (q r ) (p q) (p r )
p (q r ) (p q) (p r )
Absorption laws: p (p q) p, p (p q) p
To prove: (p (p q)) p q
Fact
For every propositional formula one can construct an equivalent one in
conjunctive normal form.