CHAPTER II

DISCUSSION

A. understanding Logic
The logic is derived from the word "Logos" (Greek) which means word, speech,
or mind, pioneering logic was Aristotle (384-322 BC).
In short, the logic is defined as follows: Logic is the study of the ways that
include the principles and rules to make inferences that relied on logical reasoning.
Reasoning is a way of thinking that is used to draw conclusions on the
relationship between two or more things that are based on the properties or laws that have
recognized the truth.
In other words, the question whether or not a conclusion needs to use logic.
B. Statement
1. sentence closed
Closed sentence is a sentence whose truth value can be ascertained directly. But
not all at once both. Closed sentences we call statement.
Example: The sum of all angles of any triangle is 1800
Answer:
The statement is a true statement because the statement is a postulate in
Euclidean geometry.
To show the statement is true or false, can be used mainly in two ways,
namely:
a. Empirical Basis of showing true or false a statement based on facts that
can be encountered in everyday life.
Example: The capital city of Indonesia is Jakarta: The statement is true.
b. No empirical basis, that is right or wrong with divulging statements show
through evidence or mathematical calculations.
Example: Z is a prime number: the statement is true.

2. sentence Open
Opening sentence is a sentence that can not be determined because they contain a
truth-value variable or variables.
 example:
 P is a prime number
 X + 5 = 17

Two sentences is not the statement can be transformed into a true statement or
false by replacing x and p at a certain value.

3. Negation / negation
The simplest kind of operation is an operation that is working on a statement
(called operating uner). If it is known a statement, the new statement can be formed
by affixing the word is not right in front of the statement or if possible, insert the
words not in the statement. New statement obtained in this way is called the negation
of the negation or the original statement.
If p is a statement that is known, then the negation or a negation of p can be
written using the following symbols:
~ p(Read: not really p or not p).
Example:
 p: 3 is a factor of 12
ingkarannya is
~ P:3 is not a factor of 12
 q: 6 x 3 is equal to 18
ingkarannya is
~ Q:not really 6 x 3 is equal to 18
The truth table ~ p
p ~p
B S
S B

4. Compound statement
Compound statements are statements carved out of several single statement
(called components) by using the logic circuit.
 Example:
 4 + 2 = 6 and 6 is an even number
The statement consists of two statements, namely, 4 + 2 = 6 and 6 is an
even number. Both statements coupled with wear and conjunctions.
 Surabaya is the capital of East Java, Surabaya is a city or a hero
The statement consists of two statements, namely, Surabaya is the capital
of East Java and Surabaya is a city of heroes. Both of these statements or
conjunctions coupled circuitry.
The statements are coupled in such a manner is called a compound
statement, conjunctions and, or, referred to said logic circuit.
There are several compound statements, namely:
1. Conjunction
The combined two single statement that uses the conjunctive "and"
forming a compound statement is called a conjunction.
Conjunction of statement 𝑝 and 𝑞 (𝑝 ∧ 𝑞: Read p and q) is true
when 𝑝 and 𝑞 both are true.
Here's a truth table of a compound statement conjunctions
p q 𝑝∧𝑞
B B B
B S S
S B S
S S S
The words that form conjunctions other than words and is though, but, whereas,
when, who, too, though, and others.

Example:

a. p : Rainy day
q : the sun shines
𝑝 ∧ 𝑞 : It was raining while the sun shines

b. p : Roni naughty
 q : Roni mendacious
𝑝 ∧ 𝑞 : Roni mischievous and deceitful

c. p : he came
q : he is sick
𝑝 ∧ 𝑞 : he comes despite illness
2. disjunction
Disjunction is a combination of two statements using the
conjunctive logic "or" thus forming two compound statements.
Conjunctive "or" in mathematical logic is denoted by "˅". Disjunction of
two statements p and q can be written "˅ p q" and read "p or q".
Disjunction of statements p and q (p and q ˅: read p or q) is true if
one of p and q is true.
Here's a truth table of a compound statement disjunction
p q ˅pq
B B B
B S B
S B B
S S S

Example:

p : Whales are mammals

q : whales are herbivores

𝑝 ˅ 𝑞 : whale is a mammal or herbivorous

3. implication
Combined these two statements p and q so as to form a compound
statement by using the conjunction "if ... then ..." called implication,
written "p → q".
 The implication of the statement𝑝 and𝑞 (𝑝 ⇒ 𝑞: Read p makaq) is
false only when the statement is true and is false.
Table truth of a statement is the following implications:
p q p→q
B B B
B S S
S B B
S S B
Example:

p : Andi studied with teachers space applications

q : Andi can learn anywhere

𝑝 → : if Andi learning space applications teacher, Andy can learn anywhere

4. Biimplikasi
Biimplikasi of statement𝑝 and𝑞 (𝑝 ⟺ 𝑞: Read p if and only jikaq)
is true only when the statement and 𝑞 have the same truth value.
Here's a truth table of Biimplikasi
p q P⟺ q
B B B
B S S
S B S
S S B
Example:

p : father would earn

q : father works

𝑝 ⟺ : father would earn if and only if the father works.

5. The converse, inverse, and contraposition

Based on the implication p → q can be formed new statement, as follows:
1. the converse : p→ q
2. inverse : ~p→ ~ q
3. contraposition : ~q → ~ p
p q ~p ~q p→ q q→p ~P→~q ~Q→~p
B B S S B B B B
B S S B S B B S
S B B S B S S B
S S B B B S B B
Example:
Known statement: "If Ega Ega diligently studied the class". Specify:
a. the converse
b. inverse
c. contraposition
Answer:
a. If Ega diligently studied the ega grade
b. If ega ega not study hard then not the next grade
c. If ega ega not grade it was not studious

6. statement Berkuantor
Kuantor is a symbol that shows generalizing an open sentence. There are two types of
kuantor, namely kuantor kuantor universal and existential.
1. Universal Kuantor
The word used in the statement berkuantor universal (general) is the phrase "all"
or "every" denoted by Ɐx, p (x) is read (for all x applicable p (x)).
Example: all goats grazing
Explanation: The sentence is a proper sentence and its equivalent if the animal
was a goat, then the animal eating grass.
2. Existential Kuantor
Existential kuantor statement using the word "no" or "some" are denoted by ⱻx, p
(x) is read (no or few x applicable p (x)).
 For example: bebarapa people like to eat meatballs, equivalent to at least someone
who likes to eat meatballs.
7. withdrawal Conclusion
The main purpose of studying mathematical logic is looking for a method or a
way to retrieve the decision or draw conclusions from a statement.
The statements in which they are based is called the premise. While the resulting
pernyataanbaru called the conclusion / conclusions.
Here are some basic rules in mathematical logic, namely:
1. modus ponens
The modus ponens rule is as follows:
premise 1 : p→ q
premise 2 :p

Conclusion : *p
Example:
premise 1 : If diligently studied it smart
premise 2 : Rama diligently studied

Conclusion : * Rama smart

2. modus Tollens
Rules in Modus Tollens as follows:
premise 1 : p→ q
premise 2 :~q

Conclusion : *~p
Example:
premise 1 : If the weather is sunny then go play football Adi
premise 2 : Adi did not go play football

Conclusion : * the weather was not sunny

3. Syllogism
Rules withdrawal method is the following syllogism:
premise 1 : p→ q
premise 2 :q→r

Conclusion : *p→r
Example:
premise 1 : when exercising the body to be healthy
premise 2 : If a healthy body into a deep sleep

Conclusion : * if exercising it into a deep sleep