0% found this document useful (0 votes)
8 views83 pages

Propositional Logic in Business

mat

Uploaded by

jpp787677
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views83 pages

Propositional Logic in Business

mat

Uploaded by

jpp787677
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Logic and Reasoning for Business

Chapter 6
Propositional Logic I: Statements
and connectives

1
TABLE OF CONTENTS
 Word-string and Sentence
 Statement and Proposition
 Atomic and Compound Stateme
nts
 Logical Connectives
 More Logical Connectives
 Symbolization of Statements
 Well-formedness
 Propositional Relations

2
WORD-STRING AND SENTENCE
 Word String – a number of words put together
sequentially
 Take home examination 
 Home take examination 
 Examination home take 

 Sentence – a grammatical word-string


 Take home examination 
 Home take examination 
 Examination home take 

3
STATEMENT AND PROPOSITION
 Statement – a sentence which asserts something
 John is older than Tom.
 Tom is younger than John.
 The age of John is greater than the age of Tom.
 The age of Tom is smaller than the age of John.

 The above four statements are the same propositions


(i.e. same information are conveyed in these statements)

4
STATEMENT AND PROPOSITION
 In the following statements, different words are used, but
they are the same propositions
 John is a bachelor( 單身漢 ).
 John is an unmarried man.

While different statements can mean the same proposition, the same
statement can also be used to mean different propositions.
“You are wrong” – the meaning will be different when saying by
different persons

5
ATOMIC AND COMPOUND
STATEMENTS
 Atomic Statement – statement that cannot be further
broken down

 Compound Statement – contains parts that are


statements in themselves

 I have an ugly look but a tender heart

 John and Mary are students

 John and Mary are lovers
 John is a lover
 Mary is a lover

6
LOGICAL CONNECTIVES
 We use logical connectives to join atomic statements to
make compound statements

 Notations of logical connectives


Notation Symbol is read as
and & ampersand
or  wedge
not ~ tilde
if …. then  right arrow

p and q p&q Conjunctive statement


p or q pq Disjunctive statement
not p ~p Negative statement
if p then q pq Conditional statement

7
LOGICAL CONNECTIVES
CONJUNCTIVE STATEMENT
 A conjunctive statement (conjunction) is a compound statement
formed by more than one simple statement(conjunct)

Example 1

•Giraffe is tall and elephant is heavy.

•p = Giraffe is tall

q = Elephant is heavy

p & q

8
LOGICAL CONNECTIVES
CONJUNCTIVE STATEMENT

Example 2

•Lemon is sour and star fruit is sweet.

•p = Lemon is sour

q = Star fruit is sweet

p & q

9
LOGICAL CONNECTIVES
CONJUNCTIVE STATEMENT
 Rule in conjunction

1. Both conjuncts are true = true

2. One of the conjuncts is false = false

p q p &q
T T T
T F F
F T F
F F F
10
LOGICAL CONNECTIVES
CONJUNCTIVE STATEMENT
 Example 3

 You are young and you are successful

You are young You are successful You are young and
(p) (q) successful (p & q)
T T T
T F F
F T F
F F F

11
LOGICAL CONNECTIVES
CONJUNCTIVE STATEMENT
 Note the difference between the logical connective “&” and the
English word “and”
 The word "and“, in English, sometimes has another use, conveying
the meaning "and subsequently“
 The following two statements are not equivalent:

They got married and had a child.


They had a child and got married.

12
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT
 A compound statement is connected by the word “EITHER …
OR/OR” (inclusive)
 Example 1

 “The applicant has to be a university graduate or a member of


the professional society.”
 Example 2

 Either Christie is drawing or Nick is playing.

13
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT
 “The applicant has to be a university graduate or a member of
the professional society.”
 p = The applicant has to be a university graduate

 q = The applicant is a member of the professional society

pvq

14
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT

 Either Christie is drawing or Nick is playing.

 p = Christie is drawing

 q = Nick is playing

pvq

15
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT (cont’d)
 Rule in disjunction(inclusive)

 It is true if at least one of the two component statements is true, it is


false otherwise.

 In logic, unless otherwise stated, the disjunction is used in the


inclusive sense. The truth table is as follows:
 p  q means either p or q, or both p and q are true

He has a rich father HeHe


has
has
a rich
a rich
wife He has a rich father
(p) wife(q)
(q) or
or aa rich
rich wife(p
wife(p vvq)
q)
T T T
T F T
F T T
F F F
16
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT

 The following statements, the “OR” is used in the exclusive sense:

 Example 1
 Mary is a student of the Faculty of Engineering or the Faculty of
Medicine
 p = Mary is a student of the Faculty of Engineering
 q = Mary is a student of the Faculty of Medicine
pvq

17
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT

 Example 2

 The surname of the wife of Mr. Wong is EITHER Chan OR Chau


 p = The surname of the wife of Mr. Wong is Chan
 q = The surname of the wife of Mr. Wong is Chau
pvq

18
LOGICAL CONNECTIVES
DISJUNCTIVE STATEMENT (cont’d)
 Rule in disjunction(exclusive)

 It is true if one of the two simple statements is true

 It is false if both of them have the same value

Sam
Sam is
is drawing
singing Sam is running Either Sam is
(p) (q) drawing
singing or
running(p v q)
T T F
T F T
F T T
F F F
19
LOGICAL CONNECTIVES
NEGATIVE STATEMENT
 Negative statement is the opposite of positive statement

 e.g. The Sun rises from the East The Sun does not rise
from the East
 The negation of a statement can be formed by prefixing it with the
phrase "it is not the case“
 An alternative way to form the negation of a statement is to insert a
"not" into the statement
 The negation of "The Sun moves" is "The Sun does not move“

20
LOGICAL CONNECTIVES
NEGATIVE STATEMENT
 Rule in negation

1. Negation of true statement = false

2. Negation of false statement = true

 Consider the following example

The Earth is flat (p) The Earth is not flat(~p)


T F
F T

21
LOGICAL CONNECTIVES
CONDITIONAL STATEMENT
 A conditional statement is an if-then statement

 It is not simply an assertion that something is the case, but an


assertion that something is the case under some condition
 The component statement that follows the "if" is called the
"antecedent", and the component statement that follows the "then"
is called the "consequent"
If overall scores >= 50 then you pass the course
antecedent consequent

 A conditional statement asserts that in the case the antecedent is


true, the consequent is also true
22
LOGICAL CONNECTIVES
CONDITIONAL STATEMENT (CONT’D)
 Rule in conditional statement

1. A conditional statement is false if the antecedent is true and the


consequent is false

2. Thus, other than this form, the conditional statement is true

 In propositional logic, the conditional “if p then q" is written as


"p  q“

p q pq If today is a holiday then the shop is closed.


T T T
T F F
F T T
F F T 23
LOGICAL CONNECTIVES
Exercise 1:
Evaluate each proposition for the truth values: p is True, q is False, r is
False.
a.p &  q
b.( p   q )  r
c. (p  q ) & ( p  r)

24
Exercise 1:
Evaluate each proposition for the truth values: p is True, q is False,
r is False.
a.p &  q
b.( p   q )  r
c. (p  q ) & ( p  r)

A True

B False

C Undetermined

25
Exercise 1:
Evaluate each proposition for the truth values: p is True, q is False,
r is False.
a.p &  q
b.( p   q )  r
c. (p  q ) & ( p  r)

A True

B False

C Undetermined

26
Exercise 1:
Evaluate each proposition for the truth values: p is True, q is False,
r is False.
a.p &  q
b.( p   q )  r
c. (p  q ) & ( p  r)

A True

B False

C Undetermined

27
LOGICAL CONNECTIVES
Exercise 1 (Solution)
a.p & q

p & ~ q
T T T F
1 4 3 2

28
LOGICAL CONNECTIVES
Exercise 1 (Solution)
b.(p  q )  r

( ~ p  ~ q )  r
F T T T F T F
4 1 6 5 2 7 3

29
LOGICAL CONNECTIVES
Exercise 1 (Solution)
c.(p  q ) & (p  r)

~ ( p  q ) & ( ~ p  r )
F T T F F F T F F
6 1 5 2 9 7 3 8 4

30
LOGICAL CONNECTIVES
Exercise 2:

Create the truth table for the following propositions:


a.(p & q) &  p

b.( p   q )  p

c. (p q ) & (  p  r)

31
Exercise 2:
Create the truth table for the following propositions:
a.(p & q) &  p p q (p & q ) & ~p
T T
b.( p   q )  p T F

c. (p q ) & (  p  r) F T
F F

A T B T C F D T
F T F F
F F F T
T F F T

32
LOGICAL CONNECTIVES
Exercise 2 (Solution)
a.(p & q) & p

p q (p & q) ~p (p & q) & ~p


T T T F F
T F F F F
F T F T F
F F F T F

p q (p & q) & ~ p
T T T T T F F T
TT
T F T F F F F TT
F T F F T F T FF
F F F F F F T FF

33
Exercise 2:
Create the truth table for the following propositions:
a.(p & q) &  p p q (p  q )  p
T T
b.( p   q )  p T F

c. (p q ) & (  p  r) F T
F F

A T B F C T D T
F F F T
T F F T
T T F T

34
LOGICAL CONNECTIVES
Exercise 2 (Solution)
b.(p  q )  p

p q ~p ~q (~p  ~q) (~p  ~q)  p


T T F F F T
T F F T T T
F T T F T T
F F T T T T

35
Exercise 2:
p q R (p q ) & ( p  r)

Create the truth table for the following propositions: T T T

T T F

a.(p & q) &  p T F T

T F F
b.( p   q )  p F T T

c. (p q ) & (  p  r) F

F
T

F
F

F F F

A T B F C T D F
F F F F
F F T F
F F T T
T F T F
T F F F
F T F F
F T F T
36
LOGICAL CONNECTIVES
Exercise 2 (Solution)
c.(p  q ) & ( p  r)

p q r (p  q) ~(p  q) ~p (~p  r) ~(p  q) & (~p  r)


T T T T F F T F
T T F T F F F F
T
T F
F T
T T
T F
F F
F T
T F
T
T F
F F
F T
T F
F F
F F
F F
F
F T
T T
T T
T F
F T
T T
T F
F
F T
T F
F T
T F
F T
T T
T F
F
F F
F T
T F
F T
T T
T T
T T
F
F F
F F
F F
F T
T T
T T
T T

37
LOGICAL CONNECTIVES
Exercise 3:
Show that the propositions “(p  q) & r” and “(p & r)  (q & r)” are
logically equivalent. (i.e. whether they have the same truth table).

38
Exercise 3:
Show that the propositions “(p  q) & r” and “(p & r)  (q & r)” are
logically equivalent. (i.e. whether they have the same truth table).

(p & r)  (q &
p q r (p  q) & r
r)
T T T

A They are logically equivalent T T F


T F T

The are NOT logically T F F


B
equivalent F T T
F T F

C Undetermined F F T
F F F

39
LOGICAL CONNECTIVES
Exercise 3 (Solution)

Show that (p  q) & r is logically equivalent


to (p & r)  (q & r) by showing that they have
p q r (p  q) (p  q) & r p q r (p & r) (q & r) (p & r)  (q & r)

the same truth table.


T
T
T
T
T
F
T
T
T
F
T
T
T
T
T
F
T
F
T
F
T
F
T F T T T T F T T F T
T F F T F T F F F F F
F T T T T F T T F T T
F T F T F F T F F F F
F F T F F F F T F F F
F F F F F F F F F F F

40
MORE LOGICAL CONNECTIVES
 Basic logical connectives:
 and
 or
 not
 If

 More Logical Connectives:


 only if
 if and only if
 unless
 neither nor
 not both

41
MORE LOGICAL CONNECTIVES
 Only If

 “Only If” is different from “If”, i.e. “x only if y” is different from “x if y”

 “x only if y” – y is a necessary condition for x

 i.e. “if not y then not x”, or “if x then y”


~y ~x, or x  y

 Example:
You can graduate (G) only if you pay (P) the tuition fee.
~P  ~G, or
GP

42
MORE LOGICAL CONNECTIVES
A only if B can be written as if A then B or if not B then not A
In other words, for instance,
I go only if you go the same as If I go then you go
Also be the same as, If you don’t go then I don’t go

A if B can be written as if B then A


In other words, for the instance,
I go if you go the same as if you go then I go

43
A if B can be written as if B then A
In other words, I go if you go the same as if you go then I go

MORE LOGICAL CONNECTIVES A only if B can be written as if A then B or if not B then not A
In other words, I go only if you go the same as
If I go then you go
If you don’t go then I don’t go

 Difference between “IF” and “ONLY IF”


A B AB
 A: Alan goes to the party T T T
 B: Betty goes to the party T F F
F T T

 “if x then y” F F T

IF Alan goes to the party THEN Betty will go


“if A then B” ; “if A  B”; “A  B” A B BA
T T T
T F T
 “x if y”, the same as “if y then x”
F T F

Alan will go to the party IF Betty goes F F T

“A if B” ; “if B then A” ; “B  A”
A B A only if B AB ~B  ~A
 “x only if y” T T T T T
T F F F F
Alan will go to the party ONLY IF Betty goes
F T T T T
“A only if B” ; “A  B” ; “~B  ~A”
F F T T T
44
MORE LOGICAL CONNECTIVES
 If And Only If

 It is used in bi-conditional statement

 Conjunction of two statements: “x if y” and “x only if y”

 “x if and only if y” – y is both a sufficient condition and a necessary


condition of x

 i.e. “if y then x” & “if not y then not x”

45
MORE LOGICAL CONNECTIVES
 Example:
Nancy studies for a postgraduate degree if and only if she gets a scholarship

 It means if Nancy gets a scholarship (S), then she will pursue


postgraduate study (G), and if she does not get a scholarship (~S), then
she will not pursue postgraduate study (~G)

 "Nancy studies for a postgraduate degree" and "Nancy gets a


scholarship" are either both true or both false

 Can be translated as:


(S  G) & (~S  ~G)

 Short notation:
SG (may use symbol  instead of )

46
B A ~B ~A

MORE LOGICAL CONNECTIVES T T F F

T F F T

F T T F
 “x if and only if y”, the same as (“x if y” & “x only if y”) F F T T

Alan will go to the party IF AND ONLY IF Betty goes

A: Alan goes to the party


B: Betty goes to the party

“A if and only if B” ; (“A if B” & “A only if B”) ; (“B  A” & “A  B”) ; (“B  A” & “~B  ~A”)

A B BA AB ~B  ~A (B  A) & (A  B) (B  A) & (~B  ~A) AB


T T T T T T T T
T F T F F F F F
F
F T
T F
F T T F F F
F
F F
F T
T T T T T T

47
MORE LOGICAL CONNECTIVES
 Rules in bi-conditional statement

 A bi-conditional statement is true if both components have the same value

 Thus, if one is true and the other is false then the bi-conditional statement is
false

 Consequently, the truth table for “if and only if” is

p q pq
T T T
T F F
F T F
F F T

48
MORE LOGICAL CONNECTIVES
 Alan goes to the party IF Betty goes A B BA

A if B ; if B then A ; B  A T T T
T F T
F T F
F F T

 Alan goes to the party ONLY IF Betty goes A B AB ~B  ~A

A only if B ; A  B ; ~B  ~A T T T T
T F F F
F T T T
F F T T

 Alan goes to the party IF AND ONLY IF Betty goes


A if and only if B ; (A if B) & (A only if B) ; (B  A) & (A  B) ;
(B  A) & (~B  ~A) ; A  B
A B (B  A) & (A  B) (B  A) & (~B  ~A) AB
T T T T T
T F F F F
F T F F F
F F T T T

49
MORE LOGICAL CONNECTIVES
 Unless

 “unless” means the same as “if not”

 “x unless y” means “x if not y”, same as “if not y then x

 Example:
The picnic (P) will be held unless it rains (R).
P unless R, or
~R  P

50
MORE LOGICAL CONNECTIVES
 Unless (con’t)

 The picnic (P) will be held unless it rains (R).


P unless R, or P if not R (~R  P)
P R P unless R
T T T Have the picnic during rainy day, not violate the meaning of statement.

T F T Not rains, have picnic, match the meaning of the statement

F T T It rains, no picnic, match the meaning of the statement

F F F Not rains, no picnic, contradict to the meaning of the statement

P R ~R ~R  P
“P unless R” the same as saying “P if not R”
i.e. if not R then P T T F T

T F T T

F T F T

F F T F
51
MORE LOGICAL CONNECTIVES
 Neither Nor

 “neither x nor y” means “it is not the case that it is either x or y”


~(x  y)

 The same as saying “not x and not y”


(~x  ~y)

 Example:
Mary is neither clever (C) nor pretty (P).
~(C  P) or (~C  ~P)

52
MORE LOGICAL CONNECTIVES
 Not Both

 “not both x and y” means “it is not the case that x and y”
~(x & y)

 Same as saying “not x or not y”


(~x  ~y)

 Example:
Mary is not both clever (C) and pretty (P).
~(C & P) or (~C  ~P)

53
MORE LOGICAL CONNECTIVES
 Truth Values of Logical Connectives

A ? B
neither A nor B not both A and B
A B ~(A  B) ~(A  B)
    if only if if and only if unless ~A  ~B ~A  ~B

T T T T T T T T T T F F

T F F T F F T F F T F T

F T F T T F F T F T F T

F F F F T T T T T F T T

♣  ♥  ♥ ♣

54
ANALYSIS OF COMPLICATED
STATEMENTS
 Academic treatises ( 學術論文 ) as well as legal documents,
sometimes we find statements with rather complicated
( 複雜 ) logical structure

 Propositional logic can help to understand better the


structure of complicated statements, and they can be
used as a tool to analyze the structure of complicated
statements

55
SYMBOLIZATION OF
STATEMENTS
 Use symbol to represent a statement
 Example, the statement
I enroll AIM as well as MK

 Which has two component statements: “I enroll AIM” and


“I enroll MK”
 We may use
 A: “I enroll AIM”
H: “I enroll MK”

 then we can symbolize the given statement as


A&M
56
SYMBOLIZATION OF
STATEMENTS
 Proposition has a true or false value
 I have a sport car 
 A sport car 

 In propositional logic, use small letters to stand for


unspecified propositions and capital letters to stand for
specified propositions

57
SYMBOLIZATION OF
STATEMENTS
 Another example:
He is HARD-WORKING but he is not SUCCESSFUL

 Use a common symbol to stand for proposition, for


instance
H : “He is hard-working”
S : “He is successful”

 Symbolized as
H & ~S

58
SYMBOLIZATION OF
STATEMENTS
 Another example:
If Mok has a rich WIFE or a rich FATHER, then he does
not HAVE to work

 Use a common symbol to stand for same proposition


W : “Mok has a rich wife”
F : “Mok has a rich father”
H : “Mok have to work”

 Symbolized as
(W  F)  ~H

59
WELL-FORMEDNESS
 A well-formed formula in propositional logic can define as
follows:
 Each atomic statement is well-formed
 The negation of a well-formed formula is well-formed
 The conjunction of any two well-formed formulae is well-formed. If "p"
and "q" are well-formed (where "p" and "q" stand for any proposition,
atomic or compound), then "p & q" is well-formed
 The disjunction of any two well-formed formulae is well-formed. If "p"
and "q" are well-formed, then "p  q" is well-formed
 If "p" and "q" are well-formed, then "p  q" is well-formed
 Any statement defined in terms of a well-formed formula (as defined in
the above ways) is well-formed
 No other formula is well-formed

60
PROPOSITIONAL RELATIONS
 Propositional calculus: truth table demonstrating the
equivalence of ~p  q and p  q (i.e. (~p  q)  (p  q))

p q ~p ~p  q pq (~p  q)  (p  q)
T T F T T T
T F F F F T
F T T T T T
F F T T T T

61
PROPOSITIONAL RELATIONS
Exercise 4: Proof of Equivalence
Use truth tables to prove the equivalence of:
 (p  q)  (~p  q)
 ~(p  q)  (~p  ~q)

 ~(p  q)  (~p  ~q)

 p  (q  r)  (p  q)  (p  r)

 p  (q  r)  (p  q)  (p  r)

 (p  q)  (q  p)
 (p  q)  (q  p)
 ((p  q)  r)  (p  (q  r))
 ((p  q)  r)  (p  (q  r))
 (p  q)  (~q  ~p)

62
PROPOSITIONAL RELATIONS
Exercise 4 (Solution)
 ~(p  q)  (~p  ~q)

P
p q (p  q) ~(p  q) ~p ~q (~p  ~q) ~(p  q)  (~p  ~q)
T T T F F F F T
T F T F F T F T
F T T F T F F T
F F F T T T T T

63
PROPOSITIONAL RELATIONS
Exercise 4 (Solution)
 p  (q  r)  (p  q)  (p  r)

p q r (q  r) (p  q) (p  r) p  (q  r) (p  q)  (p  r) LHS  RHS

T T T T T T T T T

T T F F T T T T T

T F T F T T T T T

T F F F T T T T T

F T T T T T T T T

F T F F T F F F T

F F T F F T F F T

F F F F F F F F T

64
PROPOSITIONAL RELATIONS
Exercise 4 (Solution)
 (p  q)  (~q  ~p)

p q (p  q) ~q ~p (~q  ~p) (p  q)  (~q  ~p)


T T T F F T T
T F F T F F T
F T T F T T T
F F T T T T T

65
PROPOSITIONAL RELATIONS
Example 1:
1) Use the truth table to prove the equivalent of the following
statement
(p  q)  (~p  q)

66
PROPOSITIONAL RELATIONS
Example 1: (Solution)
1) Use the truth table to prove the equivalent of the following
statement (p  q)  (~p  q)

p q pq ~p ~p  q (p q)  (~p  q)


T T T F T T
T F F F F T
F T T T T T
F F T T T T

67
COMPLETE PROPOSITIONAL
RELATIONS

A? B

T  if A  B   ~  ~  ~B ~  ~A ~ if ~  F

T T T T T T T T F F F F F F F F

T T T T F F F F T T T T F F F F

T T F F T T F F T T F F T T F F

T F T F T F T F T F T F T F T F
B

not both A & B

neither A nor B
either A or B but not both
A if and only if
A unless B

A only if B

68
PROPOSITION TRANSLATION
Exercise 5:
Symbolize each of the following English sentences in the
language of propositional logic. Use the variable “P” to
stand for “Patsy majors in AIM and use the variable “Q” to
stand for “Quincy majors in AIM”.
a) Quincy majors in AIM if Patsy majors in AIM
b) Quincy majors in AIM only if Patsy majors in AIM
c) Patsy majors in AIM unless Quincy majors in AIM
d) Neither Patsy nor Quincy majors in AIM
e) Not both Patsy and Quincy major in AIM
f) Either Quincy not major in AIM or Patsy major in AIM

69
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

a) Quincy majors in AIM if Patsy majors in AIM

A Q P

B P Q

C ~Q  ~P

D ~P  ~Q

E ~Q  P

F ~P  Q
70
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

b) Quincy majors in AIM only if Patsy majors in AIM

A Q P

B P Q

C ~Q  ~P

D ~P  ~Q

E ~Q  P

F ~P  Q
71
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

c) Patsy majors in AIM unless Quincy majors in AIM

A Q P

B P Q

C ~Q  P

D ~P  ~Q

E ~Q  P

F PQ
72
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

d) Neither Patsy nor Quincy majors in AIM

A Q&P

B PQ

C ~(Q & P)

D ~P & ~Q

E ~(Q  P)

F ~P  ~Q
73
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

e) Not both Patsy and Quincy major in AIM

A P  ~Q

B P&Q

C ~(Q & P)

D ~P & ~Q

E ~Q  ~P

F ~(P  Q)
74
Exercise 5:
Symbolize each of the following English sentences in the language
of propositional logic. Use the variable “P” to stand for “Patsy major
in AIM and use the variable “Q” to stand for “Quincy major in AIM”.

f) Either Quincy not major in AIM or Patsy major in AIM

A Q P

B P Q

C ~Q  ~P

D ~P  ~Q

E ~Q  P

F ~P  Q
75
PROPOSITION TRANSLATION
Exercise 6:
Determine the truth tables of the following propositions:
a) if p then q
b) p unless q
c) neither p nor q
d) not both p and q
e) p if and only of q
f) p if q
g) p only if q

76
Exercise 6:

Determine the truth table of the following proposition:

a) if p then q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

77
Exercise 6:

Determine the truth table of the following proposition:

b) p unless q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

78
Exercise 6:

Determine the truth table of the following proposition:

c) neither p nor q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

79
Exercise 6:

Determine the truth table of the following proposition:

d) not both p and q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

80
Exercise 6:

Determine the truth table of the following proposition:

e) p if and only if q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

81
Exercise 6:

Determine the truth table of the following proposition:

f) p if q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

82
Exercise 6:

Determine the truth table of the following proposition:

g) p only if q

A 1
p q 1 2 3 4 5 6 7 8
B 2
C 3 T T T T T T T T F F

D 4
T F T T T F F F T F
E 5
F T T F F T F F T F
F 6
F F F T F T T F T T
G 7
H 8

83

You might also like