Pertemuan 1

Bahasa Inggris untuk

Pengajaran Matematika
(DIK 570614)
Dosen: Khamida Siti Nur Atiqoh, S.Pd., M.PMat.

Prodi Pendidikan Matematika

Fakutas Ilmu Tarbiyah dan Keguruan
UIN Syarif Hidayatullah Jakarta
 1. LOGIC
A. Statements in Logic
Declarative sentences or statements or propositions
Look at some examples:
(1)Independence day of Indonesia was 17 August 1945.
(2)The largest earthquakes in Java, Indonesia, occurred around 1800’s.
(3)A half is greater than one and half.
(4)Puppies are cuter than kittens.
(5)This is the last entry on this list.

what are the characteristics of the examples above?

The sentences generally involve a reaction such as, “true,” or “false,” no way
that is true, could be true, maybe true, or exactly false, wrong, or even
impossible.
Declarative sentences ⟹ Kalimat pernyataan
1. LOGIC
 1. LOGIC
propositions

a statement that is, by itself, either true or false.

Negation of a statement
The negation or denial of statement p, we can create by a strategic
placement of the word NOT somewhere in the statement. ¬ p is true if and
only if p is false.
Ex: ": Ali eats manggoes
¬" or ":̅ Ali does not eat manggoes
%: Today is Monday and I’ll go to London
¬% or %& : Today isn’t Monday or I won’t go to London

Could you write the truth table of negation?

 1. LOGIC
Combining statements
Let two statements are joined by AND and OR. We can decide wether the
compound statement is true (T) or false (F) based on the truth or falsity of
its component statements.

Could you write the truth table of ! ∧ # and ! ∨ # ?

 1. LOGIC
If– then Statements (Implication)
The statement “If !, then ",” which notation as ! ⇒ ", we call ! the
hypothesis condition and " the conclusion.

• p ⇒ q means “if p is true,

q is true as well.”
• Recall: The only way for p
⇒ q to be false is if we
know that p is true but q
is false.
 1. LOGIC
Biimplication
The biimplication connective p ⟺ q is read “p if and only if q.”
Intuitively, either both p and q are true, or neither of them are.
 1. LOGIC
Logical Equivalence
Definition. Two statements are said to be logically equivalent if they have
precisely the same truth table values. If ! and " are logically equivalent,
we write ! ⟺ ".

Ex:
!∧ "∨' ⟺ !∧" ∨ !∧'

Could you prove the equivalence of the statement above?

 1. LOGIC
B. More Negations
 1. LOGIC
Negating Implications
 1. LOGIC
Formulas and Logical Operator

Seven special symbols known as logical operators:

 Exercise
Translate into your language
Thank You