Logic Presentation
Logic Presentation
Logic Presentation
Examples: Each of the following statements is a proposition, some are true and some are false. Can
you tell which are true, and which are false? If it false, state why.
a) P: 9 is a prime number.
b) Q: PhilSCA-Main Campus is located in Makati City.
c) R: The sum of 3 and 8 is 11.
d) S: 10 < -3.
The following are not proposition
It is an interrogative sentence.
It does not state a complete thought. So, we cannot say whether it is true or
false.
x is a variable representing a number. But why is it not a proposition? It is
because specific value of x is not given so we cannot say whether it is true or
false.
Determine whether each of the following statements is a
proposition or not. If proposition, give its truth value.
1. The capital of Philippines is Manila.
3. Philippines is in China.
Determine whether the proposition is simple or compound. If it is compound, identify the primitive
components.
1. Julius is a Math and Science major.
Compound
p: Julius is a Math major.
q: Julius is a Science major.
p q pq
T T T
T F F
F T F
F F F
CONJUNTION
The conjunction q
p“June has 30 days and 3 is odd.”
Is true because p is true and q is also true.
3. If x = 2, then x2 = 4
4.
5. Please call me up.
6. Today is Monday.
7. An equilateral triangle is also isosceles.
8. Parallel lines do not intersect.
9. Where do you live?
10.
DISJUNCTION
In each of the following, construct the disjunction.
Determine the truth value of each.
12.
Pagsanjan Falls is in Batangas.
14. 32 is odd
23 is even
Use table 1-A and 1-B to construct the truth table for each of the following.
1. pqr
2. pqr
3. pqr
4. pqr
Definition 4: Negation
Let p be a proposition. The negation of p, denoted by ~𝑝, is the
statement “It is not the case that p.”
The proposition ~𝑝 is read as “not p”. The truth value of the
negation of p, ~p, is the opposite of the truth value of p.
“3 is not odd.”
“It is not true that 3 is odd.”
“It is false that 3 is odd.”
NEGATION
p or p or ~p
pq or ( p q) or ~ ( p q)
To be consistent with our symbolism, we shall use the third
notation, that is, the negation sign . The symbol is read “not p”.
NEGATION
Table 1-C
Table 1-C is the truth table for .
p
It Table 1-C ~p
proposition F T
Solution:
(a) ~ p = “5 is not divisible by 2.”
(b) ~ q = “ .”
(c) ~ ( p q) = “It is not true that 5 is divisible by 2 and .”
Solution:
The truth table for isq)constructed
~ (p by use Table 1-A and Table 1-C.
NEGATION
Table 1-D
p q pq
~ ( p q)
T T T F
T F F T
F T F T
F F F T
Table 1-E
P q ~p ~q ~ p ~ q
T T F F F
T F F T T
F T T F T
F F T T T
NEGATION
Negate each of the following:
1. X2 – 1 is factorable.
2. 4 is not odd.
3. 5 = 8
4. Today is Monday.
5. He is tall and handsome.
6. 5 + 2 7 or 42 = 16.
7. Christmas is December 25th or I am happy.
8. I am rich and she is cute.
Definition 8: Conditional Statements (Implication) Let p and q be propositions.
The conditional statement 𝒑 → 𝒒 is the proposition “if p, then q.”. The conditional
statement 𝑝 → 𝑞 is false when p is true and q is false, and true otherwise. In the
conditional statement 𝑝 → 𝑞, p is called the hypothesis (or antecedent or premise)
and q is called the conclusion (or consequence).
Note: When 2 compound propositions always have the same truth value, then
they are called equivalent (logically equivalent). The symbol ⟺ is sometimes
used instead of ≡ to denote logical equivalence.
Write/state the converse, inverse, and contrapositive of the
following statements.
4. If Tom is Ann’s father, then Jim is her uncle and Sue is her aunt.
CONDITIONAL
PROPOSITION
Table 1-G is a combination of the truth tables of and its converse . this table shows that
whenever p q and q p are both true, their components are either true together (TT) or false
together (FF).
P Q
Table 1-G
T T T T
T F F T
F T T F
F F T T
a. p → q
b. ~q ↔ r
Express each of these propositions as an English sentence.
d. (p → ~r) ∨ (q → ~r)
Verify the following logical equivalences Involving Conditional
and Biconditionals using truth tables.
a. ~(𝑝 → 𝑞) ⇔ 𝑝 ∧ ~𝑞
b. 𝑝 ∨ 𝑞 ⇔ ~𝑝 → 𝑞
c. (𝑝 → 𝑞) ∧ (𝑝 → 𝑟) ⇔ 𝑝 → (𝑞 ∧ 𝑟)
d. ⇔
e. (( p ʌ q) → ( p v q ) ⇔ T