Logical

Mathematics
By:
Ahmad Aldino A. S. (1305621016)
Anggy Setyawati (1305621029)
Mohammad Wildan (1305621039)
 LOGICAL
MATHEMATICS
Logic is one of the fields of science that studies the
principles of reasoning and drawing valid conclusions,
both deductive and which is inductive.
Logic formulates laws that can be used as a tool to
assess whether the results of an idea are true or valid.
The laws will be used in the thought process itself. We
can fix way of thinking by studying logic in order to
regulate the way of thinking.
Statement and Form of Statement
A. Statement and Open Sentence

1. Statement
A statement (proposition) is a declarative sentence (close sentence) that has exactly one truth value,
namely "True" (T) or "False" (F), and not both.
Examples:
7 is a prime number. (T)
Semarang is the capital of the province of Central Java (T)
3 × 4 = 7 (F)

2. Open Sentence
An open sentence is a sentence that is not a statement because it is still using variables. Open sentence
can be changed into statement by: (a) Replacing the variable with a constant, or (b) Using the quantifier.
Examples:
X is an even number
2𝑥 + 4 = 10
The sea view is so beautiful
Statement and Form of Statement
B. Single Statement and Compound Statement

1. Single Statement
A statement is a sentence that has a truth value: True or False, but not both. The statement here
means single statement, which can be immediately known the value of the truth. The correct
statement is indicated by "T" and the statement which is incorrectly indicated by "F". A single
statement can also be called with declarative sentences, statements, or propositions. Single
statement can represented by the symbol p, q, r, or something else.

2. Compound Statement
Two or more single statements can be combined into a new sentence which is a compound
statement. Components of compound statement does not always have to be a single statement,
but it may be a compound statement. To combine single statements into compound statements,
join words or conjunctions are called mathematical logic operations.
Statement and Form of Statement
C. Mathematical Logic Operations

Formal Name Symbol Read Symbolic Form

Negation ~ “Not” ~𝑝

Conjunction ∧ “And” 𝑝∧q

Disjunction ∨ “Or” 𝑝∨q

Conditional → “If-then” 𝑝→𝑞

Biconditional ↔ “If and only if” 𝑝↔𝑞

 01
NEGATION
The negation of a statement is a statement
that is false if the original statement is true,
and is true if return statement is false.
The sign used is " − " or "~". When a statement
expressed by 𝑝 then ~𝑝 is the negation or 𝒑 ~𝐩
negation of 𝑝. "~𝑝" read T F
not 𝑝 or not true 𝑝.
F T
Example :
If “𝑝" indicates the wall is white" then "~𝑝" is
"The wall is not white." It can also be said: "It is
not true that the wall is white".
 02
CONJUNCTION
 A compound statement that is formed by combining
two single statements using the conjunction "and" is
called a conjunction. Conjunction operations are
CONJUNCTION TRUTH TABLE denoted by “∧"
𝒑 𝒒 𝑝 ∧ 𝑞 The conjunction of two statements 𝑝 and 𝑞 (written
“𝑝 ∧ 𝑞" reads “𝑝 and 𝑞“) is T (true) if and only if the two
T T T statements 𝑝 and 𝑞 are T (true), while for other truth
T F F
values of 𝑝 and 𝑞, “𝑝 ∧ 𝑞” is F (false).

F T F Example:
𝑝 = Jakarta is the capital city of the Republic of
Indonesia (correct value)
F F F

𝑞 = Bandung is located at Java Island (correct value)

𝑝 ∧ 𝑞 = Jakarta is the capital city of the Republic of
Indonesia and Bandung is located at Java Island (value
True)
03
DISJUNCTION
 𝒑 ∨ 𝒒: Inclusive Disjunction
𝒑 ⊻ 𝒒: Exclusive Disjunction
A compound statement formed by combining two
single statement using the conjunction "or" is called a Written “𝒑 ⊻ 𝒒” and read “p or q
but not p and q” is true only if
disjunction. The disjunction operation is denoted by “∨“
one of the anatomical
Disjunction of two statements p and q (written “𝑝 ∨ 𝑞”
propositions is true but not both
and read “𝑝 or 𝑞”) is F (false) if and only if the two
statements 𝑝 and 𝑞 are respectively F (false), while for
the truth values 𝑝 and another 𝑞, “𝑝 ∨ 𝑞” is T (true)
value. DISJUNCTION TRUTH TABLE

𝒑 𝒒 𝒑∨𝒒 𝒑⊻𝒒
Example :
𝑝 = Surabaya is located in the province of East Java (T) T T T F
𝑞 = One week consists of seven days (T) T F T T
𝑝 ∨ 𝑞 = Surabaya is located in East Java province or
one week consists of seven days. (T) F T T T

F F F F
 𝒑 ∨ 𝒒: Inclusive Disjunction
𝒑 ⊻ 𝒒: Exclusive Disjunction

Written “𝒑 ⊻ 𝒒” and read “p or q

Example:
but not p and q” is true only if
𝑝 = The best employee gets a prize in the form of
one of the anatomical
money (T)
propositions is true but not both
𝑞 = The best employee gets a tablet as a prize (T)
𝑝 ⊻ 𝑞 = The best employee gets a prize in the form of
money or tablet (F) DISJUNCTION TRUTH TABLE

𝒑 𝒒 𝒑∨𝒒 𝒑⊻𝒒
The statement above is true only if the best employee
gets a prize in the form of money or tablet, but does T T T F
not get money and tablet.
T F T T

F T T T

F F F F
 04
IMPLICATION
A compound statement formed by combining two a
single statement using the conjunction "If ... then ... "
is called
implications. The implication operation is denoted by
“→” IMPLICATION TRUTH TABLE
In the implication "p → q", the single statement "p" is
called the predecessors (antecedent). and the 𝒑 𝒒 𝑝 → 𝑞
statement "q" is called the follower (consequent). T T T
An implication is false if and only if its predecessor is
true and the follower is false, while for the truth T F F
values ​of its predecessors and other followers, F T T
implications is true.
F F T
Example :
p = 9 is a square number (T)
q = 6 has two prime factors (T)
p → q = If 9 is a square number then 6 has two prime
factors (T)
 05
BIIMPLICATION
 A compound statement formed by combining two
single statement using conjunctions " ...if and only if ..."
called biimplication. The biimplication operation is denoted
DOUBLE IMPLICATION by "↔“
TRUTH TABLE The truth value of "𝑝 ↔ 𝑞" is true, if and only if the truth
value of p is equal to the truth value of q, and is false, if the
𝒑 𝒒 𝑝 ↔ 𝑞 truth value of 𝑝 is different from the truth value of 𝑞.
T T T
Example :
T F F Determine the truth value of the following biimplication:
1. Tuti is the president of the Republic of Indonesia if and
F T F only if Semarang is the capital of the Republic of Indonesia
2. 7 is divisible by 15 if and only if 7 is a prime number
F F T
3. 8 + 7 = 15 if and only if 15 > 2 + 8
Answer :
1. T
2. F
3. T
 06
Tautology
Tautology is a compound proposition that is always true,
regardless of the truth values that appear in it

Example: 𝑝 ~𝑝 𝑝 ∨ ~𝑝
𝑝 ∨ ~𝑝 is a tautology
T F T

F T T
 07
Contingency
Contingency a compound proposition
that is neither a tautology nor a
contradiction
 08
Contradiction
Contradiction is a compound proposition that is always
false

Exsamples : 𝑝 ~𝑝 𝑝 ∧ ~𝑝
𝑝 ∧ ~𝑝 is a Contradiction
T F F

F T F
 09 Logical Equivalence
Table of Logical Equivalences Table of Logical Equivalences
Involving Conditional Statements. Involving Biconditional Statements.

Two statements are 𝑝 → 𝑞 ≡ ~𝑝 ∨ 𝑞 𝑝 ↔ 𝑞 ≡ (𝑝 → 𝑞) ∧ (𝑞 → 𝑝)

logically equivalent if, 𝑝 → 𝑞 ≡ ~𝑞 → ~𝑝 𝑝 ↔ 𝑞 ≡ ~𝑝 ↔ ~𝑞
and only if, their
resulting forms are 𝑝 ∨ 𝑞 ≡ ~𝑝 → 𝑞 𝑝 ↔ 𝑞 ≡ (𝑝 ∧ 𝑞) ∨ (~𝑝 ∧ ~𝑞)
logically equivalent 𝑝 ∧ 𝑞 ≡ ~( 𝑝 → ~𝑞 ) ~(𝑝 ↔ 𝑞) ≡ 𝑝 ↔ ~𝑞
when identical ~(𝑝 → 𝑞) ≡ 𝑝 ∧ ~𝑞
statement variables are
used to represent (𝑝 → 𝑞) ∧ (𝑝 → 𝑟) ≡ 𝑝 → (𝑞 ∧ 𝑟)
component statements. (𝑝 → 𝑟) ∧ (𝑞 → 𝑟) ≡ (𝑝 ∨ 𝑞) → 𝑟
(𝑝 → 𝑞) ∨ (𝑝 → 𝑟) ≡ 𝑝 → (𝑞 ∨ 𝑟)
(𝑝 → 𝑟) ∨ (𝑞 → 𝑟) ≡ (𝑝 ∧ 𝑞) → 𝑟
PROOF

𝑝 → 𝑞 ≡ ~𝑞 → ~𝑝 𝑝 ↔ 𝑞 ≡ (𝑝 → 𝑞) ∧ (𝑞 → 𝑝)

𝑝 𝑞 𝒑→𝒒 ~𝑞 ~𝑃 ~𝒒 → ~𝒑 𝑝 𝑞 𝒑↔𝒒 𝑝→𝑞 𝑞→𝑝 (𝒑 → 𝒒) ⋀ (𝒒 → 𝒑)

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

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

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

F F T T T T F F T T T T
 10 Logical Implication
Definition: a proposition p carries
logically a proposition q if and
only if any of the above three conditions
Theorem : Suppose p and q are two are met. For that we write: 𝒑 → 𝒒
composite propositions formed from
elementary propositions p, q, r,....

Then the following three conditions are

mutually equivalent (same meaning):

1. ~𝑝 ˅ 𝑞 is a tautology
2. 𝑝 ˄ ~𝑞 is a contradiction
3. 𝑝 → 𝑞 is a tautology
 HOW TO READ SYMBOLIC LOGIC
~𝒑 𝒑→𝒒 𝒑 ∨ (~𝒓 ∧ 𝒒) 𝒑 → (~𝒒 ∧ 𝒓)
You can read: You can read: You can read: You can read:
“negation p” “if p then q” “p or not r and q” “if p then parentheses not q or r”
“not p” “p implies q” “p or parentheses not r and q” “p or parentheses not r and q”

𝒑∧𝒒 𝒑↔𝒒 ~(𝒑 ∧ 𝒒) (𝒒 ∧ 𝒑) ↔ ~𝒒

You can read: You can read: You can read: You can read:
“p and q” “p if and only if q” “negation of p and q” “q or p if and only if not q”

𝒑∨𝒒 𝒑≡𝒒 (𝒑 ∨ 𝒓) → (𝒑 ∧ 𝒒)
𝒑 → 𝒒 ≡ ~𝒑 ∧ 𝒒
You can read: You can read: You can read:
You can read:
“p or q” “p is logical “p or r implies p and q”
“p implies q is logical equivalance to not p or q”
equivalence to q”
 01 01
EXERCISE SOLUTION
• All integers are natural
Determine which of the following numbers (is a statement)
sentences is a statements: • Catch that person (not a
• All integers are natural numbers statement)
• Catch that person • 17 is an odd number (is a
• 17 is an odd number statement)
• 𝑥 2 + 2𝑥 − 17 = 0 • 𝑥 2 + 2𝑥 − 17 = 0 (not a
statement)
 02 02
EXERCISE SOLUTION
• ~p its not true that 4 x 5 more than 6
Determine the negation of the
~p 4 x 5 less than or equal to 6
following statements:
• ~q its not true that 3 is a factor of 13
• P = 4 x 5 more than 6
~q 3 is not a factor of 13
• q = 3 is a factor of 13
• ~r it is not true that all students enjoy
• r = All students enjoy learning
learning math
math
~r all student is not enjoy learning math
 03 03
EXERCISE SOLUTION
A statement that is equivalent to the
A statement that is equivalent to “if form of implication is the
2 × 3 = 6, then 2 + 3 = 5” is …. contraposition, namely
A. if 2 × 3 = 6, then 2 + 3 ≠ 5 𝑝 → 𝑞 ≡ ~𝑞 → ~𝑝
B. if 2 × 3 ≠ 6, then 2 + 3 = 5 Notice that
C. if 𝟐 + 𝟑 = 𝟓, then 𝟐 × 𝟑 = 𝟔 𝑝: 2𝑥3 = 6
D. if 2 + 3 ≠ 5, then 2 × 3 ≠ 6 𝑞: 2 + 3 = 5
E. if 2 + 3 = 5, then 2 × 3 ≠ 6 ~𝑝: 2𝑥3 = 6
~𝑞: 2 + 3 = 6
Therefore, the equivalent statement
is “if 2 + 3 = 5, then 2 x 3 = 6 (C)
THANK YOU