Scribd
Upload
8 views

3-PROPOSITIONAL-LOGIC

The document introduces propositional logic, defining propositions as declarative sentences that can be true or false. It explains logical connectives, including negation, conjunction, disjunction, conditional, and biconditional, along with examples and truth tables. Additionally, it covers the concepts of converse, inverse, and contrapositive of conditional statements, providing practice exercises for better understanding.

Uploaded by

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

3-PROPOSITIONAL-LOGIC

The document introduces propositional logic, defining propositions as declarative sentences that can be true or false. It explains logical connectives, including negation, conjunction, disjunction, conditional, and biconditional, along with examples and truth tables. Additionally, it covers the concepts of converse, inverse, and contrapositive of conditional statements, providing practice exercises for better understanding.

Uploaded by

larvianzon.cvt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

INTRODUCTION OF

PROPOSITIONAL LOGIC
MATHEMATICAL LOGIC
Propositions
A proposition is any declarative sentence
that is either true or false, but not both.

Example
Which of the following are propositions?
a. Today is Wednesday.
b. Did you pass the first quiz?
c. 19 - 12 = 10
d. Exercise regularly.
e. 35 – x = 24
Propositions
Solution
a. The statement “Today is Wednesday “ is a
proposition. It may be true or not.
b. The statement ”Did you pass the first quiz?” is
not a proposition. It is not declarative.
c. The equation 19 - 12 = 10 is false. Thus, it is a
proposition
d. The statement “Exercise regularly.” is not
declarative. Hence, it is not a proposition.
e. The equation 35 – x = 24 is conditional. It is
not considered true or false unless the value
of x is given.
Logical Connectives
A proposition is said to be atomic or simple
if it cannot be further subdivided. When two or
more atomic propositions are combined using
logical connectives a compound proposition is
formed.

There are five basic logical connectives or


logical operators used in logic. These are the
negation, conjunction, disjunction, conditional,
and biconditional.
Logical Connectives
The negation of a proposition p, denoted
by p (read as "not p"), is the statement "It is not
the case that p." The truth value of p is the
opposite of the truth value of p.
Example
Express the negation of each proposition.
a. Today is Monday.
b. There are no classes tomorrow.
Solution
a. Today is not Monday.
b. There are classes tomorrow.
Logical Connectives

The conjunction of two propositions p and


q, denoted b p  q, is the proposition "p and q".
The conjunction is true when both p and q are
true and is false otherwise.

The disjunction of two propositions p and


q, denoted by p  q , is the proposition "p or q".
The disjunction is false when both p and q are
false and is true otherwise.
Logical Connectives
Example
Consider the following propositions.
p: Today is Friday.
q: Classes are suspended today.
Express the following in English sentences.
a. p  q b. p  q c. p  q
Solution
a. Today is Friday and classes are suspended.
b. Today is Friday or classes are suspended.
c. Today is Friday and (but) classes are not
suspended.
Logical Connectives
The conditional statement (also called
implication) p → q , is the proposition "if p then q".
The conditional statement p → q is false when p
is true and q is false, and true otherwise. In the
statement p → q , p is called the hypothesis (or
antecedent or premise) and q is called the
conclusion (or consequent).
The biconditional statement p  q is the
proposition "p if and only if q". The biconditional
statement p → q is true when p and q have the
same truth values, and is false otherwise.
Logical Connectives
Example
Let p: Mark studies hard.
q: Mark passes the course.
Write the following.
a. p → q b. q  p c. p → q
Solution
a. If Mark studies hard then he passes the course.
b. Mark passes the course if and only if he studies
hard.
c. If Mark does not study hard then he will not
pass the course.
Truth Tables
Truth values of propositions may be
summarized in a table. A truth table of a
proposition gives the truth values of the
proposition under all possible cases or
assignments of the atomic propositions involved.
Example
Construct truth tables for the following
propositions.
a. p → (q  p ) b. p   (q  r )
Truth Tables
Solution
a. For a compound proposition with 2 atomic
2
propositions involved, we have 2 cases. The
following table illustrates the possible values of
p → (q  p ) .
Truth Tables
Solution
b. Since p   (q  r ) has 3 atomic propositions,
there are 2 3 = 8 cases. Thus, the table below
illustrates the possible values.
The Conditional Statement
The conditional statement p → q can be
expressed in a variety of ways. The following
statements are equivalent.

if p then q p implies q
if p, q p only if q
p is sufficient for q q if p
q whenever p q is necessary for p
q when p q follows from p
q unless not p
The Conditional Statement
Example
Rewrite each of these statements in the
form "if p then q".
a. Jason will take up master’s degree if he
graduates with honors.
b. Classes are automatically suspended
whenever storm signal is raised to level 3.
c. Sara gets a good grade unless she will
not comply with all the requirements.
d. Studying hard is sufficient for getting a
good grade.
The Conditional Statement
Solution
a. If Jason graduates with honors then he will take
up master’s degrees.
b. If storm signal is raised to level 3 then classes
are automatically suspended .
c. If Sara complied with all the requirements then
she will get a good grade.
d. If you study hard then you will get a good grade.
Converse, Inverse, Contrapositive
Given a conditional statement p → q , then the
i. converse is defined as q → p ;
ii. inverse is defined as p → q ; and
iii. contrapositive is defined as q → p.

Example
Determine the converse, inverse, and
contrapositive of the conditional statement:

“If a number is divisible by 6 then it is even.”


Converse, Inverse, Contrapositive
Solution
Given :
“If a number is divisible by 6 then it is even.”
converse:
If a number is even then it is divisible by 6.
inverse:
If a number is not divisible by 6 then it is not
even.
contrapositive:
If a number is not even then it is not divisible
by 6.
Practice Exercise 3
I. Consider the following propositions.
p: Storm signal is raised to level three.
q: Classes are suspended.
r: We will have a quiz today.
Write each compound propositions in English.
1. p  q
2. p  r
3. q → r
4. q  p
5. r → ( p  q )
Practice Exercise 3
II. Determine the truth value of each
proposition given that p and r are true
statements while q is false.
1.( p  q )  r 2. (q → r )  p
3. r  ( p  q ) 4. (r  q )  ( p → r )
5.p → q  (r  p ) 6. p  q  ( p  r )
III. Construct a truth table for each proposition.
1. (p  q ) → p
2. q  ( p → q )
3.( p → q )  (q  r )
Practice Exercise 3
IV. Rewrite each proposition in the if-then form.
1. A number is even if it is divisible by 2.
2. You get promoted only if you close the deal.
3. Having two equal sides is necessary for
an isosceles triangle.
4. Classes will resume unless CHED announces
a new suspension.
V. Rewrite the given proposition in the if-then
form then determine its converse, inverse, and
contrapositive.
You’re taking care of your health
if you don’t smoke.
References

Rosen, Kenneth H. (2008). Discrete Mathematics


and its Applications. 6th edition . Boston: Mc-Graw
Hill.

Dacanay, Elvena, Lupague (2011). Introduction to


Mathematical Logic. Manila.

You might also like