STATEMENT OF LOGIC

A. Definition of Mathematical Logic

Mathematical Logic or Logic Symbols are logic that uses the language
of Mathematics, that is by using symbols or symbols.
The advantages or strength of symbolic languages are: concise, univalent /
meaningful, and universal / can be used everywhere.

B. Statement
A statement is a sentence that has true or false values, but is not at the
same time true and false (statements are also called prepositions, declarative
sentences). Correctly interpreted there is a match between what is stated with the
actual situation. Other terms of statements are closed mathematical sentences,
closed sentences, declarative sentences, statements or propositions.
Consider the following examples!
1. The Koran is the first legal source of Muslims
2. 4 + 3 = 8
3. Trim your bed!
Example number 1 is true, while example number 2 is wrong, and both are
statements. The sentence 3 above does not have true or false values, so it is not a
statement.
Open Sentences are sentences that are not necessarily true or false. Open
sentences are usually marked by a variable (variable). If the variable is replaced
by a constant in the corresponding universe, the sentence will be a statement.
Variables are symbols that indicate members who are not necessarily in the
universe of conversation, while constants are symbols that indicate certain
members of the universe of conversation. Substituting variables that cause open
sentences to be true statements is called completion or resolution. Examples of
open sentences.
1. the one sitting under the tree is beautiful
2. x + 2 = 8
A sentence besides being distinguished from statements and not statements,
sentences are also distinguished from single statements and compound statements.
A single statement or simple statement is a statement that does not contain other
statements or as part of it, whereas compound statements can be new sentences
obtained by combining several single statements.
Two or more single statements can be combined into a new sentence which
is a compound statement, while each statement part of a compound statement is
called compound statement components. The components of the compound
statement do not necessarily have to be single statements, but may be compound
statements. But the important thing is how to combine single statements into
compound statements.

C. Operations in Logic and Truth Tables

Operations in mathematics are combining single statements that produce
multiple statements. The operations that we can encounter are in the form of
logical connective logic. The following are operations in logic:
1. Negation
English / Negation from a statement is another statement obtained by adding the
word "no" or inserting the word "not" in the original statement. The account of a p
statement is presented with the symbol or –p or ~ p, and is read: "no p". If the
statement p is true, then the breakdown is false and vice versa. If p is a single
statement, then ~ p is a compound statement.
Definition: A statement and its state have the opposite truth value.
The above definition can be written in the truth table as follows:

P ~p
B S
S B
Example:
p: Jakarta the capital of the Republic of Indonesia
~ p: Jakarta is not the capital of the Republic of Indonesia.

2. Conjunction (p ˄ q)
A compound statement that is formed by combining two single
statements using the phrase "and" called conjunction. The other coupling words
are words but, as well as, etc. Conjunction operations are represented by “˄”
Definition: A conjunction is true if the components are valuable
: true, and is wrong if one of the components is wrong
The above definition can be written in the truth table as follows:

p q p˄q
B B B
B S S
S B S
S S S

3. Disjunction (p ˅ q)
A compound statement that is formed by combining two single
statements using the word string or called disjunction. The disjunction surgery is
symbolized by "V”
Definition: An inclusive disjunction is true if at least one of its components
true value, while exclusive disjunction is true if at least
the component is true but not both.
The above definition can be written in the truth table as follows:
 Inclusive Disjunction: Exclusive Disjunction:
p Q p˅q P Q p˅q
B B B B B S
B S B B S B
S B B S B B
S S S S S S

4. Implications (p → q)
A compound statement formed by combining two single statements
using the word string If ... then ... is called an implication. The implication
operation is represented by "→"
Definition: A statement of implication is only wrong if the antecedents are correct
and consequently correct
wrong, in other possibilities the implications are true.
The above definition can be written in the truth table as follows:

p q p→q
B B B
B S S
S B B
S S B

5. Implications (p ↔ q)
A compound statement formed by combining two single statements using 4
the coupling word ... if and only if it is called implication. The biimplication
operation is represented by "↔"
Definition: A biimplication statement is true if the components have
the truth value is the same, and if the components have no truth value
the same, the implications are wrong.
The above definition can be written in the truth table as follows:

p q p↔q
B B B
B S S
S B S
S S B

D. Statement Forms
Forms of statements in logic can be distinguished in
1. Contradiction, a form of compound statement whose truth value is wrong in all
respects regardless of the truth value of its components.
2. Tautology, a form of compound statement whose truth value is correct in all
respects regardless of the truth value of its components.
3. Contingency, a form of compound statement that is neither contradiction nor
tautology.
4. Equivalent, two or more compound statements that have the same truth value.
The equivalent statement is denoted by "≡" or "≈"

1. (p ˄ q) ˄ ~(p ˅ q) is a contradiction
p Q p˄q p˅q ~(p ˅ q) (p ˄ q) ˄ ~(p ˅ q)
B B B B S S
B S S B S S
S B S B S S
S S S S B S
2. p ˅ ~ (p ˄ q) is tautology
p q p˄q ~(p ˄ q) p ˅ ~(p ˄ q)
B B B S B
B S S B B
S B S B B
S S S B B

5
3. ~(p ˄ q) dan ~p ˅ ~q is contingency
p˄ ~(p ˄
P q p q ~p ~q ~p ˅ ~q
q q)
B B B S B B S S S
B S S B B S S B B
S B S B S B B S B
S S S B S S B B B
4. In example number 3, the two statements are equivalent. We can see this from
the truth value obtained.