Logic And Set Theory

Lecture 1
Introduction
• Fundamental logic concepts are the basis of all mathematical
reasoning. These concepts are important in the understanding of the
arguments of the proofs.
• Fundamental logic investigates the principles of valid reasoning and
correct inference either from the general to particular (deductive
logic), or, from particular to general (inductive logic). It aims to
determine if the reasoning is correct or not. It draws the line between
the truth value and validity of a statement.
Introduction
• Set theory, on the other hand, is an important knowledge one has to
know to be able to understand concepts in any field of mathematics,
especially modern mathematics.
Propositions
a. The square root of -1 is the imaginary number i.
b. It will rain later at 7PM tonight.
c. Every person named Joey is a boy.
d. Walk around your yard every morning.
e. For every positive integer n, n + 1 > 1.
Which of the following statements are either true or false?
Which are both (true and false)?
Which are neither (true nor false)?
Propositions
• Proposition is a statement (has subject and a predicate) that has a
truth value (either true or false). It is the building block of any theory
of logic.
• Examples:
• Today is Wednesday.
• The person in my left came late.
• 3 + 5 = 7.
Propositions
• Kinds of Propositions
• Simple Proposition or a simple statement (has one subject and one
predicate).
• Examples:
A quadrilateral has four sides.
A right triangle has no obtuse angle.
• Compound Proposition consist of simple proposition combined with the use
of logical connectives.
• Examples:
• A square is a parallelogram and four is an odd number.
• The earth is round or Pluto is a dwarf planet.
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• Let p and q be any simple propositions:

• The Conjunction of p and q, denoted by is the proposition “p and q”.

p q
T T T
T F F
F T F
F F F
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• The “and” connective is a very strict connective. For the compound
proposition to be true, both propositions combined should be true.

• The Disjunction of p and q, denoted by is the proposition “p or q”

p q
T T T
T F T
F T T
F F F
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• The Negation of p, denoted by , is the proposition “not p”.

p
T F
F T
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• The Conditional Proposition/Implication of p and q, denoted by is the
proposition “if p, then q”

p q
T T T
T F F
F T T
F F T
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• The conditional proposition is very popular in mathematical reasoning, thus
the following are the symbols frequently used to indicate this proposition.
• “if p, then q”
• “p implies q”
• “if p, q”
• “p is sufficient for q”
• “q if p”
• “q is necessary for p”
• “p if only q”
• The premise p is the hypothesis and the consequence q is the conclusion.
Propositions
• The Logical Connectives, Compound Propositions and their Truth
Tables
• The Biconditional Proposition of p and q, denoted by is the proposition “p if
and only if q”
p q
T T T
T F F
F T F
F F T

• The biconditional is true whenever the given propositions have the same truth
values.
Propositions
• Expressing Propositions in its Symbolic Form
• Let p, q, and r be the following propositions:
• p: You sleep early. q: You come to class on time. r: Your final grade is 97.
Write the following propositions using p, q, r, and logical connectives.
1. You do not sleep early, and your final grade is not 97.
2. Getting a 97 final grade and coming to class on time is necessary for sleeping early.
3. You get a grade of 97 on the final, you sleep early and you come to class on time.
Propositions
• Expressing Propositions in its English Form
• Let p, q, and r be the following propositions:
• p: 8 < 5 q: 4 < 6 r: -3 < 7
Write the following propositions using p, q, r, and logical connectives.
Propositions
• Steps in Constructing Truth Table
• Find the possible truth values of the simple propositions.
• Number of possible truth values =
• Construct the table by entering truth and false for the first letter, truth and
for the second letter, until you reach truths and false for the last letter. (Note
that the denominator is a power of 2.) It is advised that the letters
representing the propositions are arranged alphabetically.
Propositions
• Steps in Constructing Truth Table
• Example: Find the truth table for .
• Solution:
Number of possible truth values:
First Entry: , thus there are 4 true and 4 false
Second Entry: , thus there are 2 true and 2 false
Third Entry: , thus there are 1 true and 1 false
Propositions
• Steps in Constructing Truth Table
p q r
T T T F T T T
T T F F T F F
T F T F F T F
T F F F F F F
F T T T T T T
F T F T T T T
F F T T T T T
F F F T T T T
Propositions
• Logical Equivalence
• P and Q are logically equivalent if they have the same truth value, denoted
by .
Example:
Proof:
p q
T T F F T T
T F T F F F
F T F T T T
F F T T T T
Propositions
• Tautology and Contradiction
• A compound proposition that is always true no matter what the truth values
are of the simple propositions that compose it is a tautology. A compound
proposition that is always false is a contradiction. A compound proposition
that is neither a tautology nor a contradiction is a contingency.
EXAMPLE:
p
T F T F
F T T F
Propositions
• Tautology and Contradiction
• Every conditional proposition has the following properties:
a. Converse: the premise p becomes the conclusion while the conclusion q
becomes the premise.
The converse of is .
b. Contra positive: the negation of the conclusion becomes the premise while
the negation of the premise becomes the conclusion.
The contra positive of is

Theorem: The conditional proposition and its contra positive are logically
equivalent.
 Propositions
• Tautology and Contradiction
• Show that
p q r
T T T F T T T F F T
T T F T T T T F F T
T F T F T T T F F T
T F F T T T T F F T
F T T F T F F T F F
F T F T T T T F F T
F F T F F F T T T T
F F F T F T T F T T
Propositions
• De Morgan’s Law
• A.
• B.
Prove De Morgan’s Law by using truth table.
EXERCISES
A. Which of the following are propositions? For those that are, give their
corresponding truth values.
1. Get me a glass of calamansi juice.
2. Every odd integer is not divisible by two.
3. 3 + 7 = 10
4. 9 is a prime number.
EXERCISES
B. Let p: q: -2 < 4 r: 2 > 4
Find the truth values of the following compound propositions.
EXERCISES
C. Let p and q be the propositions:
p: Chester passed his algebra subject.
q: He got a perfect score in his final exam.
Express each of the following propositions as an English sentence.
EXERCISES
D. Let p, q and r be the propositions:
p: You attend your class regularly. s: You sleep early.
q: You recite often.
r: Your final grade is 97.
Write the following propositions using p, q, and r and logical connectives.
1. You recite often, but your final grade is not 97.
2. Getting a 97 final grade and attending your class regularly is not sufficient for getting
a 97 final grade.
3. You get a grade of 97 on the final, you recite often, and you attend the class regularly.
4. You will get a final grade of 97 if and only if you either sleep early or you come to
class regularly.
5. To get a final grade of 97, it is necessary for you to come to class regularly.
EXERCISES
E. Construct the truth tables for the following compound propositions:
EXERCISES
F.
1. Show that and are logically equivalent using truth table.
2. Show that and are logically equivalent using truth table.
References
Simplified Discrete Mathematics (Icutan et. al)