Discrete Mathematics

Propositions

H. Turgut Uyar

Ay seg ul Gen cata Yayml

Emre Harmanc

2001-2013

Licence

2001-2013 T. Uyar, A. Yayml, E. Harmanc

You are free: to Share to copy, distribute and transmit the work to Remix to adapt the work Under the following conditions: Attribution You must attribute the work in the manner specied by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial You may not use this work for commercial purposes. Share Alike If you alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one.

Legal code (the full license): http://creativecommons.org/licenses/by-nc-sa/3.0/

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Proposition

Denition proposition (or statement): a declarative sentence that is either true or false law of the excluded middle: a proposition cannot be partially true or partially false law of contradiction: a proposition cannot be both true and false

Proposition

Denition proposition (or statement): a declarative sentence that is either true or false law of the excluded middle: a proposition cannot be partially true or partially false law of contradiction: a proposition cannot be both true and false

Proposition

Denition proposition (or statement): a declarative sentence that is either true or false law of the excluded middle: a proposition cannot be partially true or partially false law of contradiction: a proposition cannot be both true and false

Proposition Examples

Example (proposition) The Moon revolves around the Earth. Elephants can y. 3 + 8 = 11

Example (not a proposition) What time is it? Ali, throw the ball! x < 43

Proposition Examples

Example (proposition) The Moon revolves around the Earth. Elephants can y. 3 + 8 = 11

Example (not a proposition) What time is it? Ali, throw the ball! x < 43

Proposition Variable

Denition proposition variable: a name that represents the proposition can take on the values True (T ) or False (F ) Example p1 : The Moon revolves around the Earth. (T ) p2 : Elephants can y. (F ) p3 : 3 + 8 = 11 (T )

Proposition Variable

Denition proposition variable: a name that represents the proposition can take on the values True (T ) or False (F ) Example p1 : The Moon revolves around the Earth. (T ) p2 : Elephants can y. (F ) p3 : 3 + 8 = 11 (T )

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Compound Propositions

compound propositions are obtained by

negating a proposition, or combining two or more propositions using logical connectives

primitive propositions can not be decomposed into smaller units truth table: a table that lists the truth value of the compound proposition for all possible values of its proposition variables

Compound Propositions

compound propositions are obtained by

negating a proposition, or combining two or more propositions using logical connectives

primitive propositions can not be decomposed into smaller units truth table: a table that lists the truth value of the compound proposition for all possible values of its proposition variables

Negation (NOT)

Example
Table: p

p T F

p F T

p1 : The Moon does not revolve around the Earth. T : False p2 : Elephants cannot y. F : True

Negation (NOT)

Example
Table: p

p T F

p F T

p1 : The Moon does not revolve around the Earth. T : False p2 : Elephants cannot y. F : True

Conjunction (AND)

Table: p q

Example p1 p2 : The Moon revolves around the Earth and elephants can y. T F : False

p T T F F

q T F T F

pq T F F F

Conjunction (AND)

Table: p q

Example p1 p2 : The Moon revolves around the Earth and elephants can y. T F : False

p T T F F

q T F T F

pq T F F F

Disjunction (OR)

Table: p q

Example p1 p2 : The Moon revolves around the Earth or elephants can y. T F : True

p T T F F

q T F T F

pq T T T F

Disjunction (OR)

Table: p q

Example p1 p2 : The Moon revolves around the Earth or elephants can y. T F : True

p T T F F

q T F T F

pq T T T F

Exclusive Disjunction (XOR)

Table: p

Example q p1 p2 : Either the Moon revolves around the Earth or elephants can y. T F : True

p T T F F

q T F T F

p F T T F

Exclusive Disjunction (XOR)

Table: p

Example q p1 p2 : Either the Moon revolves around the Earth or elephants can y. T F : True

p T T F F

q T F T F

p F T T F

Implication (IF)

Table: p q

p : hypothesis q : conclusion read:

if p then q p is sucient for q q is necessary for p

p T T F F

q T F T F

pq T F T T

p q

Implication (IF)

Table: p q

p : hypothesis q : conclusion read:

if p then q p is sucient for q q is necessary for p

p T T F F

q T F T F

pq T F T T

p q

Implication (IF)

Table: p q

p : hypothesis q : conclusion read:

if p then q p is sucient for q q is necessary for p

p T T F F

q T F T F

pq T F T T

p q

Implication Examples

Example p4 : 3 < 8, p5 : 3 < 14, p6 : 3 < 2 p7 : The Sun revolves around the Earth. p4 p5 : If 3 is less than 8, then 3 is less than 14. T T : True p4 p6 : If 3 is less than 8, then 3 is less than 2. T F : False p2 p1 : If elephants can y then the Moon revolves around the Earth. F T : True p2 p7 : If elephants can y then the Sun revolves around the Earth. F F : True

Implication Examples

Example p4 : 3 < 8, p5 : 3 < 14, p6 : 3 < 2 p7 : The Sun revolves around the Earth. p4 p5 : If 3 is less than 8, then 3 is less than 14. T T : True p4 p6 : If 3 is less than 8, then 3 is less than 2. T F : False p2 p1 : If elephants can y then the Moon revolves around the Earth. F T : True p2 p7 : If elephants can y then the Sun revolves around the Earth. F F : True

Implication Examples

Example p4 : 3 < 8, p5 : 3 < 14, p6 : 3 < 2 p7 : The Sun revolves around the Earth. p4 p5 : If 3 is less than 8, then 3 is less than 14. T T : True p4 p6 : If 3 is less than 8, then 3 is less than 2. T F : False p2 p1 : If elephants can y then the Moon revolves around the Earth. F T : True p2 p7 : If elephants can y then the Sun revolves around the Earth. F F : True

Implication Examples

Example p4 : 3 < 8, p5 : 3 < 14, p6 : 3 < 2 p7 : The Sun revolves around the Earth. p4 p5 : If 3 is less than 8, then 3 is less than 14. T T : True p4 p6 : If 3 is less than 8, then 3 is less than 2. T F : False p2 p1 : If elephants can y then the Moon revolves around the Earth. F T : True p2 p7 : If elephants can y then the Sun revolves around the Earth. F F : True

Implication Examples

Example p4 : 3 < 8, p5 : 3 < 14, p6 : 3 < 2 p7 : The Sun revolves around the Earth. p4 p5 : If 3 is less than 8, then 3 is less than 14. T T : True p4 p6 : If 3 is less than 8, then 3 is less than 2. T F : False p2 p1 : If elephants can y then the Moon revolves around the Earth. F T : True p2 p7 : If elephants can y then the Sun revolves around the Earth. F F : True

Implication Examples

Example If I weigh over 70 kg, then I will exercise.

Table: p q

p : I weigh over 70 kg. q : I exercise. when is this claim false?

p T T F F

q T F T F

pq T F T T

Implication Examples

Example If I weigh over 70 kg, then I will exercise.

Table: p q

p : I weigh over 70 kg. q : I exercise. when is this claim false?

p T T F F

q T F T F

pq T F T T

Implication Examples

Example If I weigh over 70 kg, then I will exercise.

Table: p q

p : I weigh over 70 kg. q : I exercise. when is this claim false?

p T T F F

q T F T F

pq T F T T

Biconditional (IFF)

Table: p q

read:
p if and only if q p is necessary and sucient for q

p T T F F

q T F T F

pq T F F T

(p q ) (q p ) (p q)

Biconditional (IFF)

Table: p q

read:
p if and only if q p is necessary and sucient for q

p T T F F

q T F T F

pq T F F T

(p q ) (q p ) (p q)

Biconditional (IFF)

Table: p q

read:
p if and only if q p is necessary and sucient for q

p T T F F

q T F T F

pq T F F T

(p q ) (q p ) (p q)

Example

Example The parent tells the child: If you do your homework, you can play computer games. s : The child does her homework. t : The child plays computer games. what does the parent mean? st s t st

Example

Example The parent tells the child: If you do your homework, you can play computer games. s : The child does her homework. t : The child plays computer games. what does the parent mean? st s t st

Example

Example The parent tells the child: If you do your homework, you can play computer games. s : The child does her homework. t : The child plays computer games. what does the parent mean? st s t st

Example

Example The parent tells the child: If you do your homework, you can play computer games. s : The child does her homework. t : The child plays computer games. what does the parent mean? st s t st

Example

Example The parent tells the child: If you do your homework, you can play computer games. s : The child does her homework. t : The child plays computer games. what does the parent mean? st s t st

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Well-Formed Formula

syntax which rules will be used to form compound propositions? formula that obeys these rules: well-formed formula (WFF) semantics interpretation: calculating the value of a compound proposition by assigning values to its primitive propositions truth table: all interpretations of a proposition

Well-Formed Formula

syntax which rules will be used to form compound propositions? formula that obeys these rules: well-formed formula (WFF) semantics interpretation: calculating the value of a compound proposition by assigning values to its primitive propositions truth table: all interpretations of a proposition

Formula Examples

Example (not well-formed) p p p q

Operator Precedence

1 2 3 4 5

parentheses are used to change the order of calculation

Precedence Examples

Example s : Phyllis goes out for a walk. t : The Moon is out. u : It is snowing. what do the following WFFs mean? t u s t (u s ) (s (u t )) s u t

Precedence Examples

Example s : Phyllis goes out for a walk. t : The Moon is out. u : It is snowing. what do the following WFFs mean? t u s t (u s ) (s (u t )) s u t

Precedence Examples

Example s : Phyllis goes out for a walk. t : The Moon is out. u : It is snowing. what do the following WFFs mean? t u s t (u s ) (s (u t )) s u t

Precedence Examples

Example s : Phyllis goes out for a walk. t : The Moon is out. u : It is snowing. what do the following WFFs mean? t u s t (u s ) (s (u t )) s u t

Precedence Examples

Example s : Phyllis goes out for a walk. t : The Moon is out. u : It is snowing. what do the following WFFs mean? t u s t (u s ) (s (u t )) s u t

Formula Attributes

1 2 3

tautology: true for all interpretations contradiction: false for all interpretations valid: true for some interpretations

Tautology Example

Example

Table: p (p q ) q

p T T F F

q T F T F

pq (A) T F T T

pA (B ) T F F F

Bq T T T T

Contradiction Example

Example

Table: p (p q )

p T T F F

q T F T F

p F F T T

p q (A) F F T F

pA F F F F

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Metalanguage

Denition target language: the language being worked on Denition metalanguage: the language used when talking about the properties of the target language validity, contradiction and tautology are dened in the metalanguage

Metalanguage

Denition target language: the language being worked on Denition metalanguage: the language used when talking about the properties of the target language validity, contradiction and tautology are dened in the metalanguage

Metalanguage

Denition target language: the language being worked on Denition metalanguage: the language used when talking about the properties of the target language validity, contradiction and tautology are dened in the metalanguage

Metalanguage Examples

Example a native Turkish speaker learning English

target language: English metalanguage: Turkish

Example a student learning programming

target language: C, Python, Java, . . . metalanguage: English, Turkish, . . .

Metalanguage Examples

Example a native Turkish speaker learning English

target language: English metalanguage: Turkish

Example a student learning programming

target language: C, Python, Java, . . . metalanguage: English, Turkish, . . .

Metalogic

P1 , P2 , . . . , Pn Q There is a proof which infers the conclusion Q from the assumptions P1 , P2 , . . . , Pn . P1 , P2 , . . . , Pn Q Q must be true if P1 , P2 , . . . , Pn are all true.

Metalogic

P1 , P2 , . . . , Pn Q There is a proof which infers the conclusion Q from the assumptions P1 , P2 , . . . , Pn . P1 , P2 , . . . , Pn Q Q must be true if P1 , P2 , . . . , Pn are all true.

Formal Systems

Denition consistent: for all well-formed formulas P and Q if P Q then P Q each provable proposition is actually true Denition complete: for all well-formed formulas P and Q if P Q then P Q every true proposition can be proven

Formal Systems

Denition consistent: for all well-formed formulas P and Q if P Q then P Q each provable proposition is actually true Denition complete: for all well-formed formulas P and Q if P Q then P Q every true proposition can be proven

G odels Theorem

Propositional logic is consistent and complete. G odels Theorem Any logical system that is powerful enough to express ordinary arithmetic must be either inconsistent or incomplete.

G odels Theorem

Propositional logic is consistent and complete. G odels Theorem Any logical system that is powerful enough to express ordinary arithmetic must be either inconsistent or incomplete.

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Approaches in Propositional Calculus

semantic approach: truth tables

too complicated when the number of primitive statements grow

syntactic approach: rules of inference

obtaining new propositions from existing propositions using logical implications

axiomatic approach: Boolean algebra

substituting equivalent formulas in equations

Approaches in Propositional Calculus

semantic approach: truth tables

too complicated when the number of primitive statements grow

syntactic approach: rules of inference

obtaining new propositions from existing propositions using logical implications

axiomatic approach: Boolean algebra

substituting equivalent formulas in equations

Approaches in Propositional Calculus

semantic approach: truth tables

too complicated when the number of primitive statements grow

syntactic approach: rules of inference

obtaining new propositions from existing propositions using logical implications

axiomatic approach: Boolean algebra

substituting equivalent formulas in equations

Truth Table Example

pq
contrapositive: q p converse: q p inverse: p q

Example p T T F F q T F T F pq T F T T q p T F T T qp T T F T p q T T F T

Truth Table Example

pq
contrapositive: q p converse: q p inverse: p q

Example p T T F F q T F T F pq T F T T q p T F T T qp T T F T p q T T F T

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Logical Equivalence

Denition if P Q is a tautology, then P and Q are logically equivalent: PQ

Logical Equivalence Example

Example p p F

Table: p p F

p T F

p F T

pF (A) F T

p A T T

Logical Equivalence Example

Example p q p q

Table: (p q ) (p q )

p T T F F

q T F T F

pq (A) T F T T

p F F T T

p q (B ) T F T T

AB T T T T

Laws of Logic
Double Negation (DN) (p ) p Commutativity (Co) pq qp Associativity (As) (p q ) r p (q r ) Idempotence (Ip) pp p Inverse (In) p p F

pq qp

(p q ) r p (q r )

pp p

p p T

Laws of Logic
Double Negation (DN) (p ) p Commutativity (Co) pq qp Associativity (As) (p q ) r p (q r ) Idempotence (Ip) pp p Inverse (In) p p F

pq qp

(p q ) r p (q r )

pp p

p p T

Laws of Logic
Double Negation (DN) (p ) p Commutativity (Co) pq qp Associativity (As) (p q ) r p (q r ) Idempotence (Ip) pp p Inverse (In) p p F

pq qp

(p q ) r p (q r )

pp p

p p T

Laws of Logic
Double Negation (DN) (p ) p Commutativity (Co) pq qp Associativity (As) (p q ) r p (q r ) Idempotence (Ip) pp p Inverse (In) p p F

pq qp

(p q ) r p (q r )

pp p

p p T

Laws of Logic
Double Negation (DN) (p ) p Commutativity (Co) pq qp Associativity (As) (p q ) r p (q r ) Idempotence (Ip) pp p Inverse (In) p p F

pq qp

(p q ) r p (q r )

pp p

p p T

Laws of Logic
Identity (Id) pT p Domination (Do) pF F Distributivity (Di) p (q r ) (p q ) (p r ) Absorption (Ab) p (p q ) p DeMorgans Laws (DM) (p q ) p q

pF p

pT T

p (q r ) (p q ) (p r )

p (p q ) p

(p q ) p q

Laws of Logic
Identity (Id) pT p Domination (Do) pF F Distributivity (Di) p (q r ) (p q ) (p r ) Absorption (Ab) p (p q ) p DeMorgans Laws (DM) (p q ) p q

pF p

pT T

p (q r ) (p q ) (p r )

p (p q ) p

(p q ) p q

Laws of Logic
Identity (Id) pT p Domination (Do) pF F Distributivity (Di) p (q r ) (p q ) (p r ) Absorption (Ab) p (p q ) p DeMorgans Laws (DM) (p q ) p q

pF p

pT T

p (q r ) (p q ) (p r )

p (p q ) p

(p q ) p q

Laws of Logic
Identity (Id) pT p Domination (Do) pF F Distributivity (Di) p (q r ) (p q ) (p r ) Absorption (Ab) p (p q ) p DeMorgans Laws (DM) (p q ) p q

pF p

pT T

p (q r ) (p q ) (p r )

p (p q ) p

(p q ) p q

Laws of Logic
Identity (Id) pT p Domination (Do) pF F Distributivity (Di) p (q r ) (p q ) (p r ) Absorption (Ab) p (p q ) p DeMorgans Laws (DM) (p q ) p q

pF p

pT T

p (q r ) (p q ) (p r )

p (p q ) p

(p q ) p q

Equivalence Example

Example

pq p q q p q p Co

q p DN

Equivalence Example

Example

pq p q q p q p Co

q p DN

Equivalence Example

Example

pq p q q p q p Co

q p DN

Equivalence Example

Example

pq p q q p q p Co

q p DN

Equivalence Example

Example

pq p q q p q p Co

q p DN

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Equivalence Example

Example

(((p q ) r ) q ) ((p q ) r ) q ((p q ) r ) q (p q ) (r q ) (p q ) (q r ) ((p q ) q ) r qr DM DN As Co As Ab

Duality

Denition If s contains no logical connectives other than and , then the dual of s , denoted s d , is the statement obtained from s by replacing each occurrence of by , by , T by F , and F by T . Example (dual proposition)

s : (p q ) (r T ) s : (p q ) (r F )
d

Duality

Denition If s contains no logical connectives other than and , then the dual of s , denoted s d , is the statement obtained from s by replacing each occurrence of by , by , T by F , and F by T . Example (dual proposition)

s : (p q ) (r T ) s : (p q ) (r F )
d

Principle of Duality

principle of duality Let s and t be statements that contain no logical connectives other than and . If s t then s d t d .

Topics

1 Propositions

Introduction Compound Propositions Well-Formed Formulas Metalanguage

2 Propositional Calculus

Introduction Laws of Logic Rules of Inference

Rules of Inference

Denition if P Q is a tautology, then P logically implies Q : PQ

Logical Implication Example

Example p (p q ) q

Table: p (p q ) q

p T T F F

q T F T F

pq (A) T F T T

pA (B ) T F F F

Bq T T T T

Inference

establishing the validity of an argument, starting from a set of propositions which are assumed or proven to be true notation p1 p2 ... pn q

p1 p2 pn q

Inference

establishing the validity of an argument, starting from a set of propositions which are assumed or proven to be true notation p1 p2 ... pn q

p1 p2 pn q

Trivial Rules

Identity (ID) p p

Contradiction (CTR) F p

Trivial Rules

Identity (ID) p p

Contradiction (CTR) F p

Basic Rules

OR Introduction (OrI) p pq

AND Elimination (AndE) pq p AND Introduction (AndI) p q pq

Basic Rules

OR Introduction (OrI) p pq

AND Elimination (AndE) pq p AND Introduction (AndI) p q pq

Basic Rules

OR Introduction (OrI) p pq

AND Elimination (AndE) pq p AND Introduction (AndI) p q pq

Implication Elimination

Modus Ponens (ImpE) pq p q

Modus Tollens (MT) pq q p

Implication Elimination

Modus Ponens (ImpE) pq p q

Modus Tollens (MT) pq q p

Implication Elimination Example

Example (Modus Ponens) If Ali wins the lottery, he will buy a car. Ali has won the lottery. Therefore, Ali will buy a car. Example (Modus Tollens) If Ali wins the lottery, he will buy a car. Ali did not buy a car. Therefore, Ali did not win the lottery.

Implication Elimination Example

Example (Modus Ponens) If Ali wins the lottery, he will buy a car. Ali has won the lottery. Therefore, Ali will buy a car. Example (Modus Tollens) If Ali wins the lottery, he will buy a car. Ali did not buy a car. Therefore, Ali did not win the lottery.

Fallacies

arming the conclusion pq q p (p q ) q p: (F T ) T F

denying the hypothesis pq p q (p q ) p q : (F T ) T F

Fallacies

arming the conclusion pq q p (p q ) q p: (F T ) T F

denying the hypothesis pq p q (p q ) p q : (F T ) T F

Fallacy Examples

Example (arming the conclusion) If Ali wins the lottery, he will buy a car. Ali has bought a car. Therefore, Ali has won the lottery. Example (denying the hypothesis) If Ali wins the lottery, he will buy a car. Ali has not won the lottery. Therefore, Ali will not buy a car.

Fallacy Examples

Example (arming the conclusion) If Ali wins the lottery, he will buy a car. Ali has bought a car. Therefore, Ali has won the lottery. Example (denying the hypothesis) If Ali wins the lottery, he will buy a car. Ali has not won the lottery. Therefore, Ali will not buy a car.

Provisional Assumptions

Implication Introduction (ImpI) p q pq

OR Elimination (OrE) pq p r q r r p and q are PAs

if it can be shown that q is true assuming p is true, then p q is true without assuming p is true p is a provisional assumption (PA) PAs have to be discharged

Provisional Assumptions

Implication Introduction (ImpI) p q pq

OR Elimination (OrE) pq p r q r r p and q are PAs

if it can be shown that q is true assuming p is true, then p q is true without assuming p is true p is a provisional assumption (PA) PAs have to be discharged

Provisional Assumptions

Implication Introduction (ImpI) p q pq

OR Elimination (OrE) pq p r q r r p and q are PAs

if it can be shown that q is true assuming p is true, then p q is true without assuming p is true p is a provisional assumption (PA) PAs have to be discharged

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Implication Introduction Example

Example (Modus Tollens) 1. 3. pq q p 4. 6. 8. p q q F p PA A ImpE : 1, 2 A ID : 4 ImpE : 3, 5 ImpI : 1, 6 ID : 7

2. p q

5. q F 7. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism

1. 2. Disjunctive Syllogism (DS) pq p q 4a1. 4a2. 4a . 4b 1. 4b. 5.

pq p p F q q q q

A A ID : 2 PA ImpE : 3, 4a1 CTR : 4a2 PA ID : 4b1 OrE : 1, 4a, 4b

3. p F

Disjunctive Syllogism Example

Example Alis wallet is either in his pocket or on his desk. Alis wallet is not in his pocket. Therefore, Alis wallet is on his desk.

Disjunctive Syllogism Example

Example Alis wallet is either in his pocket or on his desk. Alis wallet is not in his pocket. Therefore, Alis wallet is on his desk.

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypothetical Syllogism

1. Hypothetical Syllogism (HS) pq qr pr 3. 5.

p q r

PA ImpE : 1, 2 A ImpE : 3, 4 ImpI : 1, 5

2. p q A 4. q r 6. p r

Hypotetical Syllogism Example

Example (Star Trek) Spock to Lieutenant Decker: It would be a suicide to attack the enemy ship now. Someone who attempts suicide is not psychologically t to command the Enterprise. Therefore, I am obliged to relieve you from duty.

Hypotetical Syllogism Example

Example (Star Trek) p : Decker attacks the enemy ship. q : Decker attempts suicide. r : Decker is not psychologically t to command the Enterprise. s : Spock relieves Decker from duty.

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Hypotetical Syllogism Example

Example 1. p q A p pq qr r s s 2. q r 3. p r 4. 6. 7. r s p s 5. p s A HS : 1, 2 A HS : 3, 4 A ImpE : 5, 6

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example

pr r s x s u x u p

1. u x 2. 3. 5. u x s

A A DS : 1, 2 A DS : 4, 3

6. r s 7. 9. r p 8. p r

A MT : 6, 5 A MT : 8, 7

4. x s

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples

Example (p q ) (r s ) r x x p 1. 2. 3. r x x r A A MT : 1, 2 OrI : 3 6. (p q ) (r s ) A 7. 8. 9. (p q ) pq p MT : 6, 5 DM : 7 AndE : 8

4. r s

5. (r s ) DM : 4

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples
Example 1. 2. p (q r ) s r q p p s F 3. 4. 5. 6. 8. 9. 10. q p p q s s r r qr q q q : F A A MT : 1, 2 A A ImpE : 5, 4 ImpE : 7, 2 DS : 8, 6 AndI : 9, 3

7. p (q r ) A

Inference Examples

Example If there is a chance of rain or her red headband is missing, then Lois will not mow her lawn. Whenever the temperature is over 20 , there is no chance for rain. Today the temperature is 22 and Lois is wearing her red headband. Therefore, Lois will mow her lawn.

Inference Examples

Example p : There is a chance of rain. q : Lois red headband is lost. r : Lois mows her lawn. s : The temperature is over 20 .

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

Inference Examples

Example 1. 2. 3. (p q ) r s p s q r 4. 5. 6. 7. 9. s q s s p p q p q (p q ) ? A AndE : 1 A ImpE : 3, 2 AndE : 1 AndI : 4, 5 DM : 6 A 7, 8

8. (p q ) r

References

Required Reading: Grimaldi Chapter 2: Fundamentals of Logic

2.1. Basic Connectives and Truth Tables 2.2. Logical Equivalence: The Laws of Logic 2.3. Logical Implication: Rules of Inference

Supplementary Reading: ODonnell, Hall, Page Chapter 6: Propositional Logic