Scribd
Upload
10 views

Mathematical Logic

Uploaded by

Caryl Ruiz Villamor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
10 views

Mathematical Logic

Uploaded by

Caryl Ruiz Villamor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

LESSON 2.

Mathematical Logic
Lesson 2.3: Mathematical Logic

C. Logic
Terms:
1. Simple statement is a single statement denoted with any small
letters in the English Alphabet.
Example: r : Adele is a singer.
s : The sum of 4 and 5 is greater than 6.
t : The qoutient of 95 and 5 is 19.

2. Compound statement contains two or more simple statement.


Example: Adele is a singer and the qoutient of 95 and 5 is 19.
The sum of 4 and 5 is greater than 6 or Adele is a singer.
Lesson 2.3: Mathematical Logic

3. Logical connectives combine simple statements to form compound


statements.
Example: Adele is a singer and the qoutient of 95 and 5 is 19.
The sum of 4 and 5 is greater than 6 or Adele is a singer.

4. Truth value of the statement could be True (T) or False (F).

5. Truth value table contains all possible truth values of the statement.
Lesson 2.3: Mathematical Logic

Truth Value Tables of Propositional Logic


Let p and q be two statements. Then,
A. Assertion is the basis of truth values for a particular statement/s. That is,
p
T
F

B. Negation (~ = not) is the opposite truth value of the assertion. That is,

p ~p (not p)

T F
F T
Lesson 2.3: Mathematical Logic

C. Conjunction (˄ = and/but). p ˄ q, can be read as p and/but q, is true (T) if


both p and q are true. Otherwise, false (F). That is,
p q p˄q
T T T
T F F
F T F
F F F

D. Disjunction (˅ = or). p ˅ q, can be read as p or q, is true (T) if one of them is


true. Otherwise, false (F). That is,
p q p˅q
T T T
T F T
F T T
F F F
Lesson 2.3: Mathematical Logic
E. Conditional (→ = “implies”, “If p, then q”). p → q, can be read as if p then q
where p is the hypothesis and q is the conclusion, is true (T) if both p and q has
the same truth values. If not, follow the truth value of the conclusion. That is,
p q p→q
T T T
T F F
F T T
F F T
F. Biconditional (↔). p ↔ q, can be read as p if and only if q, is true (T) if both
p and q have the same truth values. Otherwise, false (F). That is,
p q p↔q
T T T
T F F
F T F
F F T
Lesson 2.3: Mathematica Logic
Constructing Truth Table of Compound Statements
Step 1. Determine the number of possible truth values using 2n where n
is the number of statements.
Step 2. Construct the truth value table applying the truth values of the
propositional logic. The first column should be for the letter that comes
first in the English Alphabet.

Example. Construct a truth value table of the following compound statements.


1. (p ˅ q) ˄ ~q
2. ~p ˅ (~q → p)
3. p ˅ (q ↔ s)
Lesson 2.3: Mathematical Logic

Solution: 1. (p ˅ q) ˄ ~q
Step 1. Determine 2n where n=2 since we have 2 statements p and q. That is,
2n = 22 = 4 possible truth values for p and q.
Step 2. Construct the table.
p q p˅q ~q (p ˅ q) ˄ ~q
T T T F F
T F T T T
F T T F F
F F F T F
Lesson 2.3: Mathematical Logic

2. ~p ˅ (~q → p)
Step 1. 2n = 22 = 4 possible truth values for p and q.
Step 2.
p q ~p ~q ~q → p ~p ˅ (~q → p)

T T F F T T
T F F T T T
F T T F T T
F F T T F T
Observe that the truth values of ~p ˅ (~q → p) are all true, then it is called
tautology. If the truth values are all false, it is called contradiction.
Lesson 2: Mathematical Logic

3. p ˅ (q ↔ s)
Step 1. 2n = 23 = 8
Step 2.
p q s q↔s p ˅ (q ↔ s)

T T T T T
T T F F T
T F T F T
T F F T T
F T T T T
F T F F F
F F T F F
F F F T T
Lesson 2.3: Mathematical Logic

Logical Equivalence (≈)


Separated statements are said to be logically equivalent if they have the
same truth values.
Example: Determine of p → q and ~p ˅ q are logically equivalent.
Solution:
p q p→q p q ~p ~p ˅ q
T T T T T F T
T F F T F F F
F T T F T T T
F F T F F T T

Thus, p → q ≈ ~p ˅ q.
Let p and q be two statements.

n = 2, =
p q
T T
T F
F T
F F
p, q, and r. n = 3, =

p q r
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F

You might also like