Logic

Logic – defined as the science that evaluates arguments.

- Study of the methods used to distinguish correct reasoning from poor reasoning.

Statement/ Proposition – a sentence or mathematical expression that is either true or false, but
not both.

Propositional Variable – letters used to represent a proposition. E.g. p: Roses are red.

Truth Value – truthfulness or falsity of a proposition. (T or F only)

Identify if the following statements are propositions and if they are, identify their truth value.

1. The Earth is round.

2. Quezon City is the capital of the Philippines.

3. Please do your homework.

4. What time is it?

5. 5 + 3 = 9.

Compound Propositions – propositions composed of two or more statements joined by connectives.

Ex.

Simple Compound
P: June 12 is the Philippine independence day. S: Roses are red and violets are blue.
Q: 4 + 5 = 10 – 1 T: 1=3 and 4 is a real number.
R: A decade is 100 years. U: Cats are mammals or dogs are reptiles.

The fundamental property of a compound proposition is that its truth value is completely
determined by the truth value of its subpropositions, together with the way in which they are
connected to form the compound propositions.

Logical Operations

1. Conjunction – the conjunction of the proposition p and q is the compound proposition “p and q”
denoted by p ^ q.

Ex. p: Man is rational.

q: 2 + 1 = 4
p ^ q : Man is rational and 2 + 1 = 4.

The truth value for the conjunction of propositions p and q is given by:
 P Q P^Q
T T T
T F F
F T F
F F F
Note: P ^ Q is only true if both p and q are true.

Example: 1. p: 5 + 2 = 7
q: Manny Pacquiao is a Senator.

2. p: Japan is found in Asia.

q: Tokyo is the capital of China.

3. p: 10 – 4 = 5
q: 3 is less than -4

2. Disjunction - The disjunction of p and q, written P VQ , is the statement formed by joining

statements P and Q using the word “or”.

-the statement P vQ is true if at least one of the statements P and Q is true; otherwise
P v Q is false. The symbol “v” is read “or”.

P Q P˅Q

F F F

F T T

T F T

T T T

3. Negation - The negation of P, written ~P, is obtained by negating the proposition p.

4. Conditional statements – Statements in the form of “If P, then Q.” P is called the antecedent or
hypothesis and Q is the consequence or conclusion.

P Q P→Q
T T T
T F F
F T T
F F T
Converse – if q, then p.
Inverse – if not p, then not q.
Contrapositive – if not q, then not p.

Ex. “If 2 is an integer, then 2 is a rational number.”

5. Biconditional Statements – these are statements in the form of p↔q which is equivalent to
(p→q)^(q→p). this is read as “P if and only if Q”

P Q P↔Q
T T T
T F F
F T F
F F T
Ex. X + 4 = 7 if and only if x = 3. (t)
x^2 = 36 if and only if x = 6. (f)

Consider the following statements:

p: Today is Friday.
q: It is raining.
r: I am going to the movie.
s: I am not going to the basketball game.

A. Write the following compound statements in symbolic form.

1. Today is Friday and it is raining. (p^q)

2. I am going to the basketball game or I am going to a movie. (~sVr)
3. It is raining and I am going to a movie. (~qVr)
4. If it is raining, then I am not going to the basketball game. (q→s)

B. Write the following symbols into statements.

1. ~p^r
2. ~s^~r
3. r↔q
4. p→~r

p: you get a promotion.

q: you complete the the training.
r: you will receive a bonus.

1. write (p^q)→r as an English statement

2. Write “If you do not complete the training, then you will not get a promotion and you will not
receive a bonus”.

Quantifiers and Negation

In a statement, the words none, no, all, and every are called universal quantifiers. The
quantifiers no and none deny the existence of something., whereas the quantifiers all and every are
used to assert that every element satisfies some conditions.

For instance, what is the negation of “All dogs are mean” (a false statement)? You may think
that the negation is “No dogs are mean.” But it is also false, therefore negation is not done simply
by adding or removing no/not/none for statements with universal quantifiers. The correct negation
will be “Some dogs are not mean”,” At least one dog is not mean” or “There exists a dog that is not
mean”.

Proposition Negation
All X are Y. Some X are not Y.
No X are Y. Some X are Y.
Some X are not Y. All X are Y.
Some X are Y. No X are Y.

Identify the negation of the following statements.

1. Some airports are open.

2. All movies are worth the price of admission.
3. No odd numbers are divisible by 2.
4. All bears are brown.
5. No smartphones are expensive.
6. Some vegetables are not green.