GROUP 5.

LOGIC
MATHEMATICS IN MODERN WORLD
 CONTENT
01 LOGIC STATEMENT AND QUATIFIERS

02
TRUTH TABLES AND
TAUTOLOGIES

03
CONDITIONAL, BICONDITIONAL, RELATED
STATEMENTS

04 SYMBOLIC ARGUMENTS

05
ARGUMENTS AND EULER
DIAGRAMS
LOGIC STATEMENT
AND
QUATIFIERS
LOGIC

- Proper or reasonable way of thinking about or

understanding something.

- A way of thinking about something.

LOGIC STATEMENT
Every language contains different types of sentences,
such as statements, questions and commands. For A Statement is a
instance declarative sentence that
is either true or false but
"Is the test today?". Is a question. not both
"Go get the newspaper". Is a command. true and false.
"This is a nice car". Is an opinion.
"Baler is the capital of Aurora". Is a statement of fact.

Ex.
Your paragraph A simple declarative sentence has a My dog is sick.
simple sentence structure, consisting of a subject and a It is a nice day
predicate. Examples of declarative sentences in the Pizza is the best.
simple form include: Sam is Smart
 Example 1: Identify the Statement
Determin wether each sentence is a statement.

a. Florida is a state in the United c. You may not know whether 99 + 2 is a

States. prime number; however, you do not know
b. How are you?
that it is a whole number larger than 1, so
c. 99+2 is a prime number
it is either a prime number or it is not a
d. x+1=5.
prime number. The sentence is either true
Solution: or it is false, and it is not both true and
a. Florida is one of the 50 states in false, so it is a statement.
the United States,
so this sentence is true and it is a
Statement . d. x+1=5 is a statement
b. The sentence "How are you?" is a question ;
it is not a declarative sentence. Thus it is
not a statement. .
Check your progress

Determine whether each sentence is a statement.

a. Open the door.

b. 7055 is a large number.

c. In the year 2024, the president of the United States will be a woman.

d. x > 3
 Simple Statement and Compound Statements

A Simple Statement is a statement that conveys a single idea.

A Compound Statements is a statement that conveys two or more ideas.

Connecting simple statement with words and phrases such as and, or, if ... then, and if and
only if creates a compound statement.

For instance, "I will attend the meeting or I will go to school." is a compound statement.

It is composed of the two simple statements. "I will attend the meeting." And "I will go to
school."

The word or is a connective for the two simple statements.

Logic connective and symbols
Example 2 Write the Negation of a Statement

Write the negation of each statement.

a. Ellie Goulding is an opera singer.

Ans. Ellie Goulding is not an opera singer.

b. The dog does not need to be fed.

Ans. The dog needs to be fed.

 Check your progress

Write the negation of each statement.

a. The Queen Mary 2 is the world's largest cruise ship.

b. The fire engine is not red.

Example 3 Write Compound
Statements
in Symbolic Form

Consider the following simple Write the following compound statements in symbolic
statements. form.
p: Today is Friday.
a. Today is Friday and it is raining.
r: I am going to a movie. b. It is not raining and I am going to a movie.
c. I am going to the basketball game or I am going to a
q: It is raining. movie.
d. If it is raining, then I am not going to the basketball
s: I am not going to the basketball game.
game.
Solution: a. p ⋀ q b. ~q ⋀ r
c. ~s ⋁ r d. q → s
Check your progress

• Consider the following

simple statements. Write the following compound statements in
symbolic form.
•p: Today is Friday.
•r: I am going to a movie. a. Today is not Friday and I am going to a movie.
•q: It is raining. b. I am going to the basketball game and I am
•s: I am not going to the not going to a movie.
c. I am going to a movie if and only if it is
basketball game.
raining.
d. If today is Friday, then I am not going to a
movie,
 Example 4 Translate Symbolic
Statements

Write each of the following symbolic statements in words

Consider the following statements.
a. q ⋀ p b. ~r ⋀ s c. s ↔ ~p
•p: The game will be played in Atlanta a. The game will be shown on CBS and the game
•q: The game will be shown on CBS. will be played in Atlanta.
•r: The game will not be shown on ESPN.
• s: The Mets are favored to win.
b. The game will be shown on ESPN and the
Mets are favored to win.

c. The Mets are favored to win if and only if the game

will not be played in Atlanta.
 Check your progress

Consider the following statements.

e: All men are created equal.

t: I am trading places
a: I get Abe's place.
g: I get Greorge's place

Write each of the following symbolic statements

in words.

a. e ⋀ ~t b. a ⋁ ~t c. e → t d. t ↔ g
Compound Statement and Grouping Symbols

If a compound statement is written in a symbolic form, then parentheses are used to

indicate which simple statements are grouped together. The use of parentheses to
indicate groupings for statements in symbolic form.
If a compound statement is written as an English sentence, then a
comma is used to indicate which simple statements are grouped
together. Statements on the same side of a comma are group together.
Example 5 Translate Compound
Statements
a. Write (p ⋀ q) → r as an English sentence.

Let p, q, and r represent the

following. Ans. If you get a promotion and you complete the
training, then you will receive a bonus.

p: You get a promotion. b. Write "If you do not complete the training. then
you will not get a promotion
q: You complete the and you will not receive a bonus." in symbolic
training. form.
r: You will receive a bonus.
Ans. ~ q → (~ p ^ ~r)
Check your progress
Let p, q, and r represents the following.
p: Kesha's singing style is similar to Uffie's.
q: Kesha has a messy hair.
r: Kesha is a rapper.

a. Write (pq) →ras an English sentence.

a. Write "If Kesha is not a rapper, then Kesha does not a messy
hair and Kesha's singing style is not similar to Uffie's." in
symbolic form.
TRUTH TABLE AND
TAUTOLOGIES
WHAT IS TRUTH TABLE?
TRUTH TABLE
• a handy little logical device

•a mathematical table used in logic-specifically in

connection with Boolean algebra, boolean functions, and
propositional calculus

•sets out the functional values of logical expressions on

each of their functional arguments, that is, for each
combination of values taken by their logical variables.
 IMPORTANCE OF TRUTH TABLES
• help us determine all the truth value possibilities of various
statements.

• help us better understand logic.

• used to define logical connectives.

• help us identify various distinctions (such as tautologies, self-

contradictions, consistent statements, equivalent statements, and
valid arguments).
LOGICAL CONNECTIVES
The five connectives used in propositional logic are the
following:

1. "and" (A),
"not")‫(ר‬,
2.
3."or" (V),
4. "implies" (→),
5. "if and only if" (↔).:
 HOW TO READ THE TRUTH TABLE:

p q p^q ←These are statement "p^q" stands for "p and q."
The first row says "p" is true, "q" is true, and
TT T ← "paq is true." The second row says "p" is true
The second row says "p" is true, "q" is false, and
TF F← "paq" is false.
The third row says "p" is false, "q" is true, and
FT F ← "paq is false.
FF F ← "paq" is false.
The fourth row says "p" is false, "q" is false, and
•There is a column (vertical area) under each statemen which contains every
possible truth value. The column under "p" has "T, T, F, F" (true, true, false, false).
The column under "q" is "T, F, T, F" (true, false, true, false). The column under "p ^
q" contains "T, F, F, F" (true, false, false, false).

•Every row (horizontal area) beneath the statements contains every combination of
truth values. The first row of truth values states that "p," "q," and "p ^ q" are all true.
The second row states that "p" is true, "q" is false, and "p ^ q" is false. The third states
that "p" is false, "q" is true, and "p A q" is false. The fourth states that "p," "q" and "p
^ q" are all false.
 Example:
Life will exist on Life used to exist on Life used to exist on
Mars in the future Mars. Mars and life will exist
on Mars in the future

T T T

T F F

F T F

F F F
Logical true Logical false Logical identity
• The output value is The output value is never Logical identity is an
always true, regardless true: that is, always false, operation on one logical
of the input value of p regardless of the input value value p, for which the output
of p value remains p

P T P F P P

T T T F T T

F T F F F F
 Logical negation Logical conjunction (AND)
Logical negation is an operation on one logical value, •Logical conjunction is an operation on two logical values,
typically the value of a proposition, that produces a typically the values of two propositions, that produces a value of
true if both of its operands are true.
value of true if its operand is false and a value of false
•p AND q (also written as p ^ q, Kpq, p & q, or p {\displaystyle
if its operand is true. \cdot} \cdot q

p ‫ר‬p p q p^q

T T T

T F T F F

F T F

F T F F F
Logical disjunction Logical equality
(OR)
•Logical disjunction is an operation on two logical •Logical equality (also known as biconditional) is an operation on
values, typically the values of two propositions, that two logical values, typically the values of two propositions, that
produces a value of true if both operands are false or both
produces a value of true if at least one of its operands
operands are true.
is true. •p XNOR q (also written as pq, Epq, p = q, or p = q)
•p OR q (also written as pq, Jpq, p≠q, or p + q)

p q p=>q p q p↔q

T T T T T T

T F F T F F

F T T F T F

F F T F F T
 Logical NAND Logical NOR
•The logical NAND is an operation on two logical
•The logical NOR is an operation on two logical values, typically
values, typically the values of two propositions, that
the values of two propositions, that produces a value of true if
produces a value of false if both of its operands are
both of its operands are false. In other words, it produces a value
true. In other words, it produces a value of true if at
of false if at least one of its operands is true.
least one of its operands is false.
•p NOR q (also written as p↓ q, or Xpq)
•p NAND q (also written as p ↑ q, Dpq, or p | q)

p q p↑q p q p↓q

T T F T T F

T F T T F F

F T T F T F

F F T F F T
TAUTOLOGIES
Tautology is a formula that is true regardless of the
interpretation of its component terms, with only the
logical constants having a fixed meaning. for
example, a formula that states, "the ball is green or
the ball is not green," is always true, regardless of
what a ball is and regardless of its colour. tautology
is usually, though not always, used to refer to valid
formulas of propositional logic.
Tautology is a repetitive statement. In logic, a formula is
satisfiable if it is true under at least one interpretation, and thus a
tautology is a formula whose negation is unsatisfiable. In other
words, it cannot be false.

Unsatisfiable statements, both through negation and affirmation,

are known formally as contradictions. A formula that is neither a
tautology nor a contradiction is said to be logically contingent.
Such a formula can be made either true or false based on the
values assigned to its propositional variables.
The double turnstile notation
⊨ S is used to indicate that S is a tautology. Tautology
is sometimes symbolized by "Vpq", and contradiction
by "Opq". The tee symbol ⊤ is sometimes used to
denote an arbitrary tautology, with the dual symbol ⊥
(falsum) representing an arbitrary contradiction; in any
symbolism, a tautology may be substituted for the truth
value "true", as symbolized, for instance, by "1"
 A tautology is a compound statement that is always true, regardless of the
truth values of its individual statements. The word tautology comes from
the Greek words tauto, meaning "same", and logy, meaning "logic".
Here are some examples of tautologies:

(p ∧ q) ⇒ p: This statement is always true because if the truth of both p and q is true, then p is true.

(p ∨ ∼ p): This statement is always true because either p is true or not p is true.

(p ⇒ q) ∨ (q ⇒ p): This statement is always true because either p will imply q or q will imply p.

All squares have four sides: This statement is always true.

A or a: This statement is always true.

(not p) implies (not not p): This statement is always true.

To determine if a statement is a tautology, you can
construct a truth table and check the truth values in the
final column. If all the values are true, then the statement is
a tautology.

Tautologies are important in logic because they are the basis

for many rules of inference and deductive reasoning.
 CONDITIONAL,
BICONDITIONAL,
RELATED STATEMENT
1). Conditional statements relate two parts - a hypothesis
(if part) and a conclusion (then part). If the hypothesis is
true, then the conclusion must be true as well.

2). The converse of a conditional statement switches the

hypothesis and conclusion. The inverse negates both parts.
The contrapositive obtains the inverse and then switches
parts.

3). A biconditional statement uses "if and only if" to join a

conditional statement with its converse when both are true.
This creates a single statement expressing their
relationship.
CONDITIONAL STATEMENTS

If-then statements
•Consists of two parts:
if, hypothesis
then, conclusion

CONDITIONAL STATEMENTS EXAMPLE:

"If two distinct lines intersect, then they intersect at exactly one point."

MORE EXAMPLES
•If two points lie in a plane, then the line containing them lies in the plane.
Hypothesis: Two points lie in a plane.
Conclusion: The line containing them lies in the plane.
MORE EXAMPLES

If 2(x+5)= 12, then X = 1.

Hypothesis: 2(x+5)=15
Conclusion: X=1

MORE EXAMPLES

A quadrilateral is a polygon.
A prime number has 1 and itself as factors.
A square is a rectangle.
THE CONVERSE, INVERSE, AND CONTRAPOSITIVE OF
A CONDITION STATEMENT

It is said that if a statement is true, its contrapositive is also true.

Moreover, if the converse is true, its inverse is also true

Consider the statement: if p, then q

i. Converse: If q, then p.
ii. Inverse: If not p, then not q
CONVERSE

To write the converse of a conditional statement, simply interchange the

hypothesis and the conclusion. That is, the then part becomes the if part.
Note that converse of a conditional statement is not always a true statement.

EXAMPLE

A. If m<A-9, then mA is a Rigth angle. Converse if m A is a right angle,

then m<A-90

B. The intersection of two distinct planes is a line.

If-then: if two distinct planes intersect, then their intersection is a line.
Converse: if the intersection of two figures is a line then
the figure are two distinct planes.
INVERSE

•To write the inverse of a conditional statement,

simply negate both the hypothesis and conclusion.

EXAMPLE

If m<A<90, then <A is an acute angle.

INVERSE if mA is not 90, then A is not an acute angle.

If two distinct lines intersect, then they intersect at one point.

INVERSE if two distinct lines do not intersect,

CONTRAPOSITIVE

To form the contrapositive of a conditional statement, first, get its inverse.

Then, interchange its hypothesis and conclusion.

EXAMPLE

a. if m<A-m<B=90, then <A and B are complementary.

Inverse: if m<A+ m<B is not equal to 90, then <A and B are complementary.

Contrapositive: If <A and B are not complementary,

then m<A B is not equal to 90.
BICONDITIONAL STATEMENT

•If a conditional statement and its converse are both true.

Then they can be joined together into a single statement called
biconditional statement.Then this is done by using the words if and only if.

EXAMPLE

a.lf a + 7 = 12 then a = 5

Conditional statement: if a + 7 = 12 then a = 5

Converse statement: If a = 5 then a + 7-12

"Both the conditional statement and its converse are true statements.
Hence, the biconditional statement is true.
 SYMBOLIC
ARGUMENTS
 A symbolic argument is a set of premises and a conclusion that is written in
symbolic form to determine its validity. Symbolic logic is used to formalize logical
expressions in symbols, which can help to avoid the ambiguities of natural
language.
The thing that we are being encouraged to believe is the conclusion, while the
premises are the statements offered as supporting evidence for the conclusion that
we want to make.

Here are some examples of arguments.

Example 1
Premise 1:If I do not have to go to summer school, then I will get an internship.
Premise 2: I have to go to summer school.
Conclusion:I won’t get an internship.
 Types of Arguments in Symbolic Logic

1. Deductive Arguments: Deductive arguments aim to guarantee the truth of the

conclusion given the truth of the premises. If the premises are true, the
conclusion must be true. Deductive reasoning is concerned with validity.
Example: Modus Ponens or Modus Tollens.

2. Inductive Arguments: Inductive arguments, unlike deductive arguments, aim to

provide probable support for the conclusion. Even if the premises are true, the
conclusion might still be false. Inductive reasoning is not typically represented
symbolically in formal logic, but rather focuses on patterns and generalizations.
Conditional Arguments: Conditional arguments involve propositions connected by "if...
then..." statements. They are often represented using implications (→). Valid argument
forms involving conditionals include:
Modus Ponens: P→QP \rightarrow QP→Q, PPP, therefore QQQ.
Modus Tollens: P→QP \rightarrow QP→Q, ¬Q\neg Q¬Q, therefore ¬P\neg
P¬P.
Hypothetical Syllogism: P→QP \rightarrow QP→Q, Q→RQ \rightarrow
RQ→R, therefore P→RP \rightarrow RP→R.

Disjunctive Arguments: Disjunctive arguments involve "either... or..." statements. A

common valid form is:
Disjunctive Syllogism: P∨QP \vee QP∨Q, ¬P\neg P¬P, therefore QQQ.
For an argument to be "good," the truth of an argument’s premises
must guarantee the conclusion occurs. If this is the case, we will say
that the argument is valid. When the truth of an argument’s
premises fails to guarantee the conclusion, we will say that the
argument is invalid.
An argument is valid if its conclusion necessarily follows from the
premises. Otherwise, the argument is invalid.
 Law of Detachment
Also called modus ponens.
To Determine Whether an Argument is Valid
1. Write the argument in symbolic form.
2. Compare the form of the argument with forms that are known to be either
valid or invalid. If there are no known forms to compare it with, or you do not
remember the forms, go to step 3.
3. If the argument contains two premises, write a conditional statement of the
form
[(premise 1) ⋀ (premise 2)] → conclusion
4. Construct a truth table for the statement above.
5. If the answer column of the truth table has all trues, the statement is a
tautology, and theargument is valid. If the answer column of the table does not
have all trues, the argument is invalid.
Example #2: Determining the Validity of an Argument with a Truth Table
Determine whether the following argument is valid or invalid.

If you watch Good Morning America, then you see Robin Roberts.
You did not see Robin Roberts.
∴ You did not watch Good Morning America.

Solution
Let
p: You watch Good Morning America.
q: You see Robin Roberts.
In symbolic form, the argument is
p→q
~p
∴ ~p
The argument is [(p → q) ⋀ ~q] → ~p.
 Example #3: Identifying a Standard Argument
Determine whether the following argument is valid or invalid.
If you are on Facebook, then you see my pictures.
If you see my pictures, then you know I have a dog.
∴ If you are on Facebook, then you know I have a dog.

Solution
Let
p: You are on Facebook.
q: You see my pictures.
r: You know I have a dog.
In symbolic form, the argument is
p→q
q→r
∴ p→ r
It is the law of syllogism and is valid.
ARGUMENTS AND
EULER DIAGRAMS
 Arguments and a Valid
Argument
An argument consists of a set of statements called premises and another
statement called the conclusion. An argument is valid if the conclusion is
true whenever all the premises are assumed to be true. An argument is
invalid if it is not a valid argument.
An Euler Diagram is a Dramatic Means of
Representing Sets and their Relationship

General
Argument
Specific
Argument
Create a Euler Diagram to Test the Validity of an Argument

Ex. Coffee lover

All Teachers love Coffee

Ms. Joanne is a Teacher } premises

therefore
Teachers

Ms. Joanne

Ms. Joanne loves Coffee conclusion

 Create a Euler Diagram to Test the Validity of an Argument

Energy drink
Ex. lovers

Athletes

}
All athletes loves energy drink
premises
Sydney loves energy drink Sydney
therefore
Sydney is an athlete conclusion
THANK YOU MINA-SAN!