THE TWO DOORS

You are in a room with two doors. One

door leads to certain death, and the
other door leads to freedom. There are
two guards, one in front of each door.
One guard always tells the truth, and the
other guard always lies. You don't know
which guard is which, and you don't
know which door leads to freedom.
You can ask one guard one question to
determine which door leads to freedom.
What question do you ask?
Answer: Ask either guard, "If I were to ask
the other guard which door leads to freedom,
what would he say?" Then, choose the
opposite door of what the guard indicates.
Explanation:
• If you ask the truthful guard, he will
truthfully tell you what the lying guard would
say, so you can do the opposite.
• If you ask the lying guard, he will lie about
what the truthful guard would say, leading
you to the correct door as well.
 OBJECTIVES

Write the negation of a statement.

Construct a truth tables for the
negation, disjunction, and
conjunction, conditional and bi-
conditional.
Classify a statement as a tautology, a
self – contradiction, or neither.
Write the converse, inverse and
contrapositive of a statement.
LOGIC
Formal study of reasoning and
inference. It provides a systematic way
to analyze and evaluate arguments,
proofs, and mathematical statements.
Logic is an essential foundation for the
rigorous development of mathematics,
ensuring that mathematical reasoning
is valid and reliable.
 STATEMENTS

It is an expression that can

be classifi ed as having a
defi nite truth value.
Mathematical statements
are fundamental to the
formulation of theorems,
conjectures, and
mathematical arguments.
 DECIDE WHICH OF THE FOLLOWING
ARE STATEMENTS AND WHICH ARE
NOT.
Most scientists agree that global
warming is a threat to the environment.
Statement
Is that your laptop?
Not
Man, that hurts!
Not
This book is about database
management.
Statement
 SIMPLE AND COMPOUD
STATEMENT

A simple statement contains

only one idea. Each of these
statements is an example of a
simple statement.
Your jeans are torn.
My room has a pile of dirty
socks in it.
 A compound statement is a
statement formed by joining two or
more simple statements with a
connective. There are four basic
connectives used in logic: and ( the
conjunction), or (disjunction), if….
Then (conditional), and if and only if
(biconditional).
Here are some examples of compound
statements using connectives.
John studied for 5 hours, and he got an A.
(conjunction)
I’m going to pass this class or I’m going to
change my major. (disjunction)
If I get 80% of the questions on the LSAT
right, then I will get into law school.
(conditional)
We will win the game if and only if we score
more points than the other team.
(biconditional)
 QUANTIFIED STATEMENTS

 Quantifi ed Statements involve terms such

as all, each, every, no, none, some, there
exists, and at least one. The fi rst fi ve (all,
each, every, no, none) are called universal
quantifi ers because they either include or
exclude every element of the universal set.
The latter three (some, there exists, at least
one) are called existential quantifi ers
because they claim the existence of
something, but don’t include the entire
universal set. Here are some examples of
quantifi ed statements.
Every student taking philosophy this semester
will pass.
 (universal)
No nursing student is also majoring in criminal
justice.
 (universal)
Some people who are Miami Hurricane fans are
also Miami Dolphin fans.
(existential)
There is at least one professor in this school
who does not have brown eyes.
(existential)
 NEGATION

The negation of a statement is a

corresponding statement with the opposite
truth value. This means that if a statement is
true its negation is false, and if a statement
is false its negation is true. The typical way
to negate a simple statement is by adding the
word not, as in these examples:
 SYMBOLIC NOTATION

Type of
Connective Symbol
Statement
and Λ conjunction

Or ˅ Disjunction

Not Negation

If…then Conditional
If and only if
Simple statements in logic are usually
denoted with lowercase letters like and For
example, we could use to represent the
statement “I get paid Friday” and to
represent the statement “I will go out this
weekend”. Then the conditional statement “If
I get paid Friday, then I will go out this
weekend” can be written in symbols as .
The symbol ~ (tilde) represents a
negation. If still represents “I get paid
Friday”, then represents “I do not get paid
Friday”.
We often use parenthesis in logical
statements when more than one connective is
involved in order to specify an order.
Example: Studying Order in Logical
Connectives
 Let p = “Large Coney is a Dog”
 q = “Guinness is a cat”
What does the statement mean?
 “Large Coney is not a dog and Guinness is a
cat.”
What does the statement mean?
It is not the case thet Large Coney is a dog
and Guinness is a cat.
 TRUTH TABLES

 A truth table is a diagram in table form that

is used to show when a compound statement
is true or false based on the truth values of
the simple statements that make up that
compound statement. This will allow us to
analyze arguments objectively.
 CONJUNCTIONS

The connective and implies the idea of

“both.” For the conjunction to be true, both p
and q must be true. All the four possible
combinations of truth values for the
conjunction p and q are summarized by a
table called a truth table.
 TRUTH TABLE FOR THE
CONJUNCTION P AND Q (P ˄ Q)

The conjunction P The conjunction P ˄

˄ Q is true when Q is true when p
p and q are both and q are both
P Q true; otherwise, the
true; otherwise, conjunction is
the conjunction false.
is false.
P˄Q
T T T
T F F
F T F
F F F
 DISJUNCTIONS

If Rowan says that he has been reading or

writing, then he is telling the truth if he has
been reading and not writing. Likewise, he is
telling the truth when he has been writing
and not reading. Also, he is telling the truth
when he has been reading and also writing.
Table below, shows the truth table for
disjunction. The use of or in this case is
called inclusive or (inclusive disjunction).
 INCLUSIVE OR – ONE OR THE
OTHER, OR BOTH.
 Truth table for the Inclusive Disjunction P or Q (P ˅ Q)

Inclusive
disjunction is true
unless both
components are
false.

Inclusive
disjunction is true
when at least one
statement is true.
 EXCLUSIVE OR – ONE OR THE
OTHER, NOT BOTH.
Truth Table for the Exclusive Disjunction P or
Q (P ˅ Q) .
Exclusive
disjunction is true
when one
component is true
and other is false.
 NEGATION

If P is a simple proposition, then P is either

true or false but not both. That is, if P is a
true statement, then its truth value is true
and if P is false, then its truth value is false.
 If we negate P and P is true, then ~P must
be false, and if P is false, then ~P must be
true.

~P is false when P is true,

and ~P is true, when P is
false.
 CONDITIONAL

 Truth Table for Conditional Statement (PQ)

P Q is false only when

P is true and q is false;
otherwise, it is true.
 TRUTH TABLE OF
BICONDITIONAL P Q

P Q is true when and

only P and Q have the
same truth value.
 EXAMPLES

 a .)

P Q
T T T F
T F F T
F T F T
F F F T
 b.)

PQ
TT T F
TF T F
FT T F
FF F T
C.) P Q

P Q PQ
T T F F
T F T T
F T F T
F F T T
P Q ~P
T T F T T T
T F F F T F
F T T T T T
F F T T F F
THANK YOU!!