Unit 2: LOGIC

SLIDESMANIA
 LOGIC

● It is the formal systematic study of the principles of valid inference

and correct reasoning.
Logic examines:
(a) general forms which arguments may take,
(b) which forms are valid, and
(c) which forms are fallacies.
● The initial motivation for the study of logic was to learn to
distinguish good arguments from bad arguments.
SLIDESMANIA
 Simple and
Compound
Statements
SLIDESMANIA
 STATEMENTS

● A statement is defined as a declarative sentence that is either true

or false, but not both at the same time.
SLIDESMANIA
 DRILL

Determine whether each

sentence is a statement.
SLIDESMANIA
 Bhutan is a country in Asia.
SLIDESMANIA

Statement
 How are you?
SLIDESMANIA

Not
 Go get the light stick.
SLIDESMANIA

Not
 1+3 is a prime number.
SLIDESMANIA

Statement
 𝑥+1=5
 
SLIDESMANIA

Statement
 Today is a nice day.
SLIDESMANIA

Not
 COMPOUND STATEMENTS

● A compound statement may be formed by combining two or more

statements.
● The statements making up the compound statement are called the
component statements.
● Connectives such as and, or, not, and if …then, can be used in
forming compound statements.
SLIDESMANIA
 STATEMENTS
Determine whether or not the following sentences are simple statements, compound
statements, or neither.
Today is extremely warm. Statement
If Sheldon said it, then it must be Compound Statement (if, then)
true.
Monica is cleaning the house. Statement

Monica is cleaning the house while Compound Statement (while/and)

Chandler is playing with Joey.
SLIDESMANIA
 NEGATION
● A negation is a statement that is a refusal or denial of some other statement.

Statement: Max has a valuable card.

Negation: Max does not have a valuable card.
● The negation of a true statement is false and the negation of a false statement is true.

Statement: The number 9 is odd.

Negation: The number 9 is not odd.
SLIDESMANIA

Statement: The product of 2 negative numbers is not positive.

Negation: The product of 2 negative numbers is positive.
 Write the negation of each statement.

Statement Answer

1. Ed Sheeran is an opera singer. 1. Ed Sheeran is not an opera singer.

2. The dog does not need to be fed. 2. The dog need s to be fed.

3. The fire engine is not red. 3. The fire engine is red.

4. Today is a holiday. 4. Today is not a holiday.

SLIDESMANIA
 Connectives
SLIDESMANIA
 CONNECTIVES

● To simplify work with logic, symbols are used.

● Statements are represented with letters, such as p, q, or r, while
several symbols for connectives are shown below.

Connective Symbol Type of Statement

and Conjuction
or
or Disjunction
Disjunction
not
not Negation
Negation
If,
If, then Conditional
SLIDESMANIA

then Conditional
If
If and
and only
only if
if Bi-conditional
Bi-conditional
 CONNECTIVES
 
Conjunction

● The
  conjunction is the joining of two statements p and q denoted by
.
● The connective ‘and’ implies ‘both’ is denoted by the symbol .
SLIDESMANIA
 CONNECTIVES
 
Disjunction

● The
  disjunction of p and q is the compound statement “p or q”
denoted by .
● The connective ‘or’ implies ‘either’ is denoted by the symbol .
SLIDESMANIA
 Connectives
Translate the following statements into
Consider the following simple statements.
symbolic form.

 
1. Today is Friday and it is
p: Today is Friday. raining.

q: It is raining.
r: I am going to a movie.
s: I am not going to the
basketball game.
SLIDESMANIA
 Connectives
Translate the following statements into
Consider the following simple statements.
symbolic form.

 
2. It is not raining and I am going to
p: Today is Friday. a movie.

q: It is raining.
r: I am going to a movie.
s: I am not going to the
basketball game.
SLIDESMANIA
 Connectives
Translate the following statements into
Consider the following simple statements.
symbolic form.

 
3. Either I am going to the
p: Today is Friday. basketball game or I am going to a
movie.
q: It is raining.
r: I am going to a movie.
s: I am not going to the
basketball game.
SLIDESMANIA
 Connectives
Translate the following statements into
Consider the following simple statements.
symbolic form.

 
4. If it is raining, then I am not
p: Today is Friday. going to the basketball game.

q: It is raining.
r: I am going to a movie.
s: I am not going to the
basketball game.
SLIDESMANIA
 Connectives
Translate the following symbolic form into
Consider the following simple statements.
English statements.

1. q˄p
p: The game will be played at
Araneta.
q: The game will be shown on tv5. The game will be shown on
r: The game will not be shown on TV5 and it will played at
gma7.
Araneta.
s: The ginebra is favored to win.
SLIDESMANIA
 Connectives
Translate the following symbolic form into
Consider the following simple statements.
English statements.

2. ~r˄s
p: The game will be played at
Araneta.
q: The game will be shown on tv5. The game will be shown on
r: The game will not be shown on GMA7 and Ginebra is favored
gma7.
to win.
s: The ginebra is favored to win.
SLIDESMANIA
 Connectives
Translate the following symbolic form into
Consider the following simple statements.
English statements.

 
3. s~p
p: The game will be played at
Araneta.
q: The game will be shown on tv5. The Ginebra is favored to win
r: The game will not be shown on if and only if the game will not
gma7.
be played at Araneta.
s: The ginebra is favored to win.
SLIDESMANIA
 Conditional and
Biconditional
Statements
SLIDESMANIA
 CONDITIONAL STATEMENTS

● If
  p and q be two statements, then the statement can be read as “If
p, then q.”
● The symbol is used “if, then”.
● In pq, the statement p is called the hypothesis while the statement q
is called conclusion.

“If you participate in class, then you will get extra points.”
SLIDESMANIA
 CONDITIONAL STATEMENTS

● Every
  conditional statement has three related statements. They are
called the converse, the inverse, and the contrapositive.
Converse: The converse of is .
Inverse: The inverse of is .
Contrapositive: The contrapositive of is .
SLIDESMANIA
 CONDITIONAL STATEMENTS

● Write the converse, inverse, and contrapositive of

If I get the job, then I will rent the apartment.

Converse: If I rent the apartment, then I get the job.

Inverse: If I do not get the job, then I will not rent the apartment.
Contrapositive: If I do not rent the apartment, then I did not get the
job.
SLIDESMANIA
 Conditional Statements
Write the converse, inverse, and contrapositive of
If we have a quiz today, then we will not have a quiz tomorrow.

Converse: If we will not have a quiz tomorrow, then we will have a quiz
today.

Inverse: If we will not have a quiz today, then we will have a quiz
tomorrow.

Contrapositive: If we will have a quiz tomorrow, then we will not have a

quiz today.
SLIDESMANIA
 BICONDITIONAL STATEMENTS

● If
  p and q be two statements, then the statement can be read as “ p if
and only if q.”
● Biconditional statements only happen if can be switched to or
p: A citizen is eligible to vote.
q: A citizen is at least 18 years old.
pq : A citizen is eligible to vote if and only if he is at least 18 years old.
SLIDESMANIA
 BICONDITIONAL STATEMENTS

●   the biconditional as the conjunction of two conditionals.

Express
p: A citizen is eligible to vote.
q: A citizen is at least 18 years old.

pq : If a citizen is eligible to vote then he is at least 18 years old.

qp: If a citizen is at least 18 years old, then he is eligible to vote.

p q = [(p → q)^ (q → p)]

If a citizen is eligible to vote then he is at least 18 years old and if a citizen is at least
SLIDESMANIA

18 years old, then he is eligible to vote.

 Quantifiers
SLIDESMANIA
 QUANTIFIERS

● Quantifiers are used extensively in mathematics to indicate how

many cases of a particular situation exist.

● Universal quantifier depicts the quantity of a population in whole or

none at all.

● Existential quantifier describes the quantity in between of all or

nothing – there exists but not certainly all.
SLIDESMANIA
 QUANTIFIERS

EXISTENTIAL QUANTIFIERS UNIVERSAL QUANTIFIERS

 Some  None/No
 There exists  All
 At least one
 Every
SLIDESMANIA
 QUANTIFIERS

Negation
Statement
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.
SLIDESMANIA
 QUANTIFIERS

Statement Negation
1.No airports are open. 1. Some airports are open.
2.Some movies are not worth 2. All movies are worth the
the price of admission. price of admission.

3.Some odd numbers are 3. No odd numbers are

divisible by 2. divisible by 2.
SLIDESMANIA
 Truth Tables
SLIDESMANIA
 TRUTH TABLES

Truth Values Truth Tables

The truth values of component A truth table shows all possible

statements are used to find the truth combinations of truth values for
values of compound statements. component statements.

 
A logical statement having n components will have rows in its truth table.
SLIDESMANIA
 TRUTH TABLE
 
Negation

T F

F T
SLIDESMANIA
 TRUTH TABLE
 
Conjunction

● The
  conjunction is true
T T T if and only if both p and
q are true.
T F F

F T F
SLIDESMANIA

F F F
 TRUTH TABLE
 
Disjunction

● The
  disjunction is true if
T T T at least one of the
components is true, and
T F T
false if both components
F T T are false.
SLIDESMANIA

F F F
 TRUTH TABLE

Conditional

● The
  conditional statement is
false if and only if the
T T T
hypothesis is true(T) and the
T F F conclusion is false(F), otherwise
F T T it is true.
SLIDESMANIA

F F T
 TRUTH TABLE

Biconditional

● The
  biconditional statement
is true if and only if the
T T T
hypothesis and conclusion is
T F F both true or both false.
F T F
SLIDESMANIA

F F T
 Try this! Under what specific conditions is the following compound statement true?

I have a high school diploma or I have a full-time job and no

high school diploma.

Translate in symbolic form.

p: I have a high school diploma.
q: I have a full-time job.
~q: I have no high school diploma.
SLIDESMANIA
 Try this! Under what specific conditions is the following compound statement true?

I have a high school diploma or I have a full-time job and no

high school diploma.

 
Translate in symbolic form.
SLIDESMANIA
 Try this! Under what specific conditions is the following compound statement true?

 
𝒑 ∨( 𝒒 ∧ 𝒑)
p q 𝒑∨(𝒒∧~𝒑)

T T

T F

F T

F F
SLIDESMANIA
 Try this! Under what specific conditions is the following compound statement true?

 
𝒑 ∨( 𝒒 ∧ 𝒑)
p q 𝒑∨(𝒒∧~𝒑)

T T F

T F F

F T T

F F T
SLIDESMANIA
 Try this! Under what specific conditions is the following compound statement true?

 
𝒑 ∨( 𝒒 ∧ 𝒑)
p q 𝒑∨(𝒒∧~𝒑)

T T F F

T F F F

F T T T

F F T F
SLIDESMANIA
 Try this! Under what specific conditions is the following compound statement true?

 
𝒑 ∨( 𝒒 ∧ 𝒑)
p q 𝒑∨(𝒒∧~𝒑)

T T F F T

T F F F T

F T T T T

F F T F F
SLIDESMANIA
 TAUTOLOGY

● It is a statement that is always true, no matter what the truth values

of the components are.
SLIDESMANIA