Professional Documents
Culture Documents
A proposition is a statement which has truth value: it is either true (T) or false (F).
Compound Propositions
Propositions may be modified by means of one or more logical operators to form what are called
compound propositions.
There are three logical operators:
Logical Connectives: used to combine two or more propositions (and, or, not, if-then, iff)
Definition: Let p and q be propositional variables
1. The DISJUNCTION of p and q is the compound statement
p or q denoted by p V q.
2. The CONJUNCTION of p and q is the compound statement
p and q denoted by p ^ q.
3. The negation of p is denoted by ~p.
4. The statement if p then q is called a CONDITIONAL statement or IMPLICATION
denoted by pq.
can be stated as: p implies q
q only if p
if p then q
when p then q
5. If p and q are propositional propositions, the compound proposition
p if and only if q is called a BICONDITIONAL proposition and is denoted by pq.
can be stated as: a necessary and sufficient p is q.
6. Let p q be an implication.
a. ~p ~q : inverse
b. q p
: converse
c. ~q ~p
: contrapositive
IMPLICATION (pq)
p
F
F
q
F
T
pq
T
T
T
T
F
T
F
T
q
F
T
F
T
pq
T
F
F
T
BICONDITIONAL (pq)
HEIRARCHY /
OF
p
F
F
T
T
PRECEDENCE
OPERATORS
~
^
v
PROPERTIES OF SENTENCES
1. Satisfiable or Contingency a statement that is TRUE for some interpretation
2. Contradiction or Absurdity a statement that is always FALSE for all
interpretation
3. Valid or Tautology - a statement that is always TRUE for all interpretation
EQUIVALENCE LAWS
Reflexivity
pp
Double Negation
~(~p)
Commutative
Associative
Distributive
Idempotency
Identity
(p^q) (q^p)
(p V q) (q V p)
(p ^ q) ^ r p ^ ( q ^ r)
(p V q) V r p V ( q V r)
p ^ (q V r) (p ^q) V (p ^ r)
p V (q ^ r) (p V q) ^ (p V r)
p^pp
pVpp
p^Tp
pVFp
p ^ (~p) F
Inverse
p V (~p) T
p^FF
Dominance
pVTT
p ^ (p V q) p
Absorption
p v (p ^ q) p
~ (p V q) ~p ^ ~q
De Morgans Laws
~(p ^ q) ~p V ~q
Contrapositive
(p q) (~q ~p)
Material Implication
(p q) (~p V q)
Material Equivalence
(p q) (p q) ^ (q p)
Exportation
[(p ^ q) r] [p (q r)]
LOGICAL IMPLICATION:
Inference rules are used to legitimately infer conclusions from known propositions.
Name
Form
Addition
P (p V q)
Simplification
(p ^ q ) p
Conjunction
p ^ q (p ^ q)
Modus ponens
[(p q ) ^ p] q
Modus Tolens
[(p q ) ^ ~ q] ~ p
Disjunctive Syllogism
[(p V q) ^ ~p] q
Hypothetical Syllogism
[(p q) ^ (q r)] pr
(Transitive)
Inference Rule
p
pVq
p^q
p
p
q
p^q
p q
p
q
p q
~q
~p
pVq
~p
q
pq
qr
Constructive Dilemma
Destructive Dilemma
p r
pq
rs
pVr
qVs
p q
rs
~qV~s
~pV~r
PROOF
Methods of proof:
1. Direct Proof (using syllogism)
2. Indirect proof
a. Contradiction- assume the given is false and arrive at a contradiction of other
given facts