BELLRINGE

R:
TRUE or FALSE

 If , then is 3.

 If , then is 4.

 A valid argument must have a

true conclusion.

Slide 1-
1
 BELLRINGE
R:
TRUE or FALSE

 If , then is 3.

 If , then is 4.

 A valid argument must have a

true conclusion.

In silence, let us
pray…
Slide 1-
2
REVIEW
 Sets and Subsets (Elements, Proper Subset)

 Set Notations (Set builder notation, Interval notation)

 Special Sets (Universal, N, Z, Q, R, etc)

 Set Operations (Union, Intersection, Difference, Complement)

 Venn Diagram
CHAPTER 3: LOGIC
 Main goal:
USE LOGIC to analyze
arguments (claims) to see if
they are valid or invalid. This is
useful for math theory, but also
in the real world any time
someone is trying to convince
you of something.
LOGIC

To analyze an argument, we
break it down into smaller
pieces: statements, logical
connectives and quantifiers.
STATEMENTS

A compound statement
A statement is a consists of simple The negation of a
declarative sentence statements combined statement must have
that is either true or using logical connectives the opposite truth
false (but not both at like and, or, if…then, if value to the original
the same time). and only if. statement.
CONNECTIVES AND SYMBOLS
Type of
Statement Connective Symbol
Statement

not p not negation

p and q and conjunction

p or q or disjunction

If p, then q if… then conditional

p if and only if q if and only if biconditional

NEGATION OF A STATEMENT

Statement: Today is Wednesday.

Negation:Today is not Wednesday.

Statement: Ellie Goulding is an opera singer.

Negation: Ellie Goulding is not an opera singer.

Statement: The dog does not need to be feed.

Negation: The dog needs to be feed.

Statement: The Queen Mary 2 is the world’s largest cruise ship.

Negation: The Queen Mary 2 is not the world’s largest cruise ship.

Statement: The fire engine is not red.

Negation: The fire engine is red.
WRITING COMPOUND
STATEMENTS
Consider the following simple statements:
Today is Wednesday.
It is raining.
I am going to a movie.
I am not going to the basketball game.

Write the following compound statements in symbolic form:

• Today is Wednesday and it is raining.
• It is not raining and I am going to a movie.
• I am going to the basketball game or I am going to a movie.
• If it is raining, then I am not going to the basketball game.
• I am not going to a movie if and only if it is raining.
WRITING COMPOUND
STATEMENTS
Consider the following simple statements:
Today is Wednesday.
It is raining.
I am going to a movie.
I am not going to the basketball game.

p^q = Today is Wednesday and it is raining.

~(p^q ) = It is not true that today is Wednesday and it is raining.

~p^~q = Today is not Wednesday and it is not raining.

~p v ~q = Today is not Wednesday or it is not raining.

~(p v q) =It is not true that today is Wednesday or it is raining.

COMPOUND STATEMENTS AND
GROUPING SYMBOLS

Symbolic English
The parentheses indicate that:
Form sentence

and are grouped together , and or

and are grouped together and , or

and are grouped together If and ,

and are grouped together then or .
EXERCISES
Consider the following simple statements:
You get a promotion.
You complete the training.
You will receive a bonus.

1. Write as an English sentence.

If you get a promotion and complete the training,

then you will receive a bonus.
2. Write “If you do not complete the training, then you will not get a
promotion and you will not receive a bonus.” in symbolic form.
EXERCISES
Consider the following simple statements:
Kesha’s singing style is similar to Maria’s.
Kesha has messy hair.
Kesha is a rapper.

1. Write as an English sentence.

If Kesha’s singing style is similar to Maria’s and

Kesha has messy hair, then Kesha is a rapper.
2. Write “If Kesha is not a rapper, then Kesha does not have messy hair and
Kesha’s singing style is not similar to Maria’s.” in symbolic form.
CLASSWORK 3

½ crosswise
BELLRINGER

 What are the logical connectives that we use?

 A definition can be a biconditional statement. Give an

example of a definition and change it to biconditional
statement.
Ex: A triangle is a 3-sided polygon.
REVIEW
Conditional If p, then q.
Converse If q, then p.
Inverse If ~p, then ~q.
Contrapositive If ~q, then ~p.
 The truth value of a simple
statement is either true (T)
or false (F).

TRUTH
VALUE The truth value of a
S compound statement
depends on the truth values
of its simple statements
and its connectives.
TRUTH TABLES

Truth Table -shows truth value of a compound If there are n component

statement for all possible truth values of the statements, then the truth
component statements. table has 2n rows
TRUTH TABLE FOR NEGATION

p ~p
T F

F T
TRUTH TABLE FOR
CONJUNCTION
p q pq
T T T
T F F
F T F
F F F
TRUTH TABLE FOR
DISJUNCTION
p q pq
T T T
T F T
F T T
F F F
TRUTH TABLE FOR
CONDITIONAL
p q p→q
T T T
T F F
F T T
F F T
GUIDED EXERCISES:
Construct a truth table for and .

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

T T T F
T F T F
F T T F
F F F T
GUIDED EXERCISES:
Construct a truth table for .

T T F T F T
T F F F T T
F T T T F T
F F T T F F
EXAMPLE( 𝑝 ∧𝑞) ∨𝑟
p q r ~()

T T T T F T

T T F T F F

T F T F T T

T F F F T T

F T T F T T

F T F F T T

F F T F T T

F F F F T T
INDEPENDENT EXERCISES:
Construct a truth table for .

T T
T F
F T
F F
QUANTIFIERS

Existential quantifier:
Universal quantifier: all,
some, there exists, for at
every, each. Statement is
least one. Statement is true
true if the claim is true for
if the claim is true for al
every object it is referring
least one object it is
to.
referring to.
NEGATIONS OF QUANTIFIED
STATEMENTS
Statement Negation

All X are Y. Some X are not Y.

No X are Y. Some X are Y.

Some X are not Y. All X are Y.

Some X are Y. No X are Y

NEGATION OF A QUANTIFIED
STATEMENT
Statement: Some airports are open.
Negation:No airports are open.

Statement: All movies are worth the price of admission.

Negation: Some movies are not worth the price of admission.

Statement: No odd numbers are divisible by 2.

Negation: Some odd numbers are divisible by 2.

Statement: No smartphones are expensive.

Negation: Some smartphones are expensive.

Statement: All bears are brown.

Negation: Some bears are not brown.

Statement: Some vegetables are not green.

Negation: All vegetables are green.
CLASSWORK 4

½ crosswise
REVIEW
 Two statements are
equivalent if they have the
same truth value for every
possible situation, and we
EQUIVALE write p ≡ q

NT  De Morgan’s Laws:
STATEMEN~(p  q) ≡ ~p  ~q
TS ~(p  q) ≡ ~p  ~q

It is not true that Today is

Monday and it is raining.
Today is not Monday or it is not
raining.
THE CONDITIONAL

p is the
If p, then q Symbols: p → q antecedent, q is
the consequent
  Equivalent to a disjunction:

USEFUL p → q ≡ ~p  q

RESULTS
FOR THE  Negation:

CONDITI ~(p → q) ≡ p  ~q

ONAL It is not true that if she loves

books, then she loves reading.
RELATED CONDITIONAL
STATEMENTS
Direct If p, then q
statement p→q If there is a storm, then there are
flashfloods.

Converse q→p If q, then p

Inverse ~p → ~q If not p, then not q

Contrapositive ~q → ~p If not q, then not p

EQUIVALENCES

Direct statement and

contrapositive are
equivalent:

p → q ≡ ~q → ~p

Converse and Inverse are

equivalent:

q → p ≡ ~p → ~q
COMMON WORDING FOR P → Q

If p, then q p is sufficient for q

If rose is a flower, then it is beautiful.

If p, q q is necessary for p
If rose is a flower, it is beautiful.

p implies q
X+1 =3 implies x=2. All p’s are q’s
Rose is a flower implies it is beautiful.

p only if q
X+1=3 only if x=2 q if p
Rose is a flower only if it is beautiful.
ANALYZING ARGUMENTS

A logical argument is made

We will use deductive
up of premises
reasoning to determine
(assumptions, statements
whether logical arguments
assumed to be true) and a
are valid or invalid.
conclusion.

An argument is valid if the

fact that all the premises are An argument that is not
true forces the conclusion to valid is invalid, or a fallacy.
be true.
TECHNIQUES TO ANALYZE
ARGUMENTS
Using truth values (assume premises are true and see if this forces
Using conclusion to be true)

Comparing Comparing with known valid or invalid arguments

For more, read https://www.siue.edu/~wlarkin/teaching/PHIL106/validity.html

VALID ARGUMENT FORMS

 Modus Ponens
[(p → q)  p] → q
 Modus Tollens
[(p → q)  ~q] → ~p
 Disjunctive Syllogism
[(p  q)  ~p] → q
 Transitivity
[(p → q)  (q → r)] → (p → r)
FALLACIES

 Fallacy of the Converse

[(p → q)  q] → p
 Fallacy of the Inverse
[(p → q)  ~p] → ~q
QUIZIZZ

QUIZ 3 on Thursday
DEDUC
TIVE VS
INDUCT
IVE
REASO
NING
DEDUCTION VS. INDUCTION
Deduction: Induction
 commonly associated  commonly known as
with “formal logic.” “informal logic,” or
“everyday argument”
 involves reasoning
from known premises,  involves drawing
or premises presumed uncertain inferences,
to be true, to a certain based on probabilistic
conclusion. reasoning.
 the conclusions  the conclusions
reached are certain, reached are probable,
inevitable, reasonable, plausible,
inescapable. believable.
DEDUCTIVE VERSUS INDUCTIVE
REASONING
Deduction Induction
 It is the form or structure  By contrast, the form or
of a deductive argument structure of an inductive
that determines its validity argument has little to do
 the fundamental property of with its perceived
a valid, deductive argument believability or credibility,
is that if the premises are apart from making the
true, then the conclusion argument seem more clear
necessarily follows. or more well-organized.
 The conclusion is said to be  The receiver (or a 3rd party)
“entailed” in, or contained determines the worth of an
in, the premises. inductive argument.
 example: use of DNA testing
to establish paternity
SAMPLE DEDUCTIVE AND
INDUCTIVE ARGUMENTS
Example of Deduction Example of Induction
 major premise: All  Boss to employee:
tortoises are “Bill has a tattoo of
vegetarians an anchor on his arm.
 minor premise: Bessie He probably served in
is a tortoise the Navy.”
 conclusion:
Therefore, Bessie is a
vegetarian
DEDUCTION VERSUS INDUCTION
---CONTINUED
 Deductive reasoning is  Inductive reasoning enjoys
either “valid” or “invalid.” a wide range of probability;
A deductive argument it can be plausible, possible,
can’t be “sort of” valid. reasonable, credible, etc.
 the inferences drawn may
 If the reasoning employed be placed on a continuum
in an argument is valid ranging from cogent at one
and the argument’s end to fallacious at the
premises are true, then the other.
argument is said to be
sound.
valid reasoning + true
premises = sound
argument
fallacious cogent
  The Michael O’Keefe Hall, a building that
houses both engineering and health sciences in
NDDU is made of cement. Another building,
Henry Ruiz Hall, that houses business and
computer science, is also made of cement.
Therefore, all buildings of NDDU are made of
cement.

 All birds have wings. An eagle has wings.

EXAMPLE Therefore, an eagle is a bird.

S  I heard lots of barking last night. The neighbor’s

dog must’ve been pretty upset about something,
since he rarely barks.

 All dogs bark. Fido is a dog, so he barks.

 Based on a survey of 2200 randomly selected

likely voters, 56.2% indicate that they will vote
for the incumbent in the upcoming election.
Therefore, approximately 56% of the votes in
the upcoming election will be for the incumbent.
Q&A
QUIZ
3-
MOO
DLE
REMINDERS