* PROPOSITIONAL

LOGIC
Kevin Ransom E. Bayron
* A propositional logic is a collection of
declarative (having a form of a statement
rather than a question or a command)
statements that has either a truth value “true”
or a truth value “false”. A propositional
consists of propositional variables and
connectives. We denote the propositional
variables by capital letters (A, B, etc.). The
connectives connect the propositional
variables.

*
* 2+2=5 it returns truth value “False”
* Even numbers is divisible by 2 it returns truth value
“True”

* Man is mortal it returns truth value “True”

* 12+9=3-2 it returns truth value “False”
* A is less than 2 It is not a proposition unless we give a
specific value of A, we cannot say whether the statement is true
or false.

*
* Negation (Ꞁ)
* And or logical conjunction (ꓥ)
* OR or logical disjunction (ꓦ)
* Implication or condition/ the If – then (→)
* Biimplication or biconditional (P↔Q)

*
* The negation of P, written ꞀP, is the statement
obtained by negating statement P
* Example
P: A is a constant
ꞀP: A is not a constant

*
 P ꞀP

True False
False True

*
* Let P and Q be statements. The conjunction of
P and Q, written PꓥQ, is the statement formed
by joining statements P and Q using the word
“and”. The statement PꓥQ is true if both P and
Q are true; otherwise PꓥQ is false.
* Example:
Paola is happy and she paints picture
8 is an even number and divisible by 2

*
 P Q PꓥQ
True True True
True False False
False True False
False False False

*
* Let P and Q be statements. The disjunction of
and Q, written PꓦQ, is the statement formed
by joining statements P and Q using the word
“or”. The statement PꓦQ is true if at least one
of the statements P and Q is true; otherwise
PꓦQ is false. The symbol ꓦ is read “or”.
* Example
Anna will hike or rock climb
3² > 8 or 2 x 3 > 8

*
 P Q PꓦQ
True True True
True False True
False True True
False False False

*
* Let P and Q be statement. The statement “if P
then Q” is called an implication or condition.
The implication “if P then Q” is written P→Q.
P is called the hypothesis, Q is called the
condition. It is false if P is true and Q is false.
The rest cases are true.

*
* Let P: It is an even number and Q: It is divisible by 2
* P→Q:
If it is an even number, then it is divisible by 2

* The CONVERSE of this implications is written Q→P

If it is divisible by 2, then it is an even number

* The INVERSE of this implication is ꞀP→ꞀQ

If it is not an even number, then it is not divisible by 2

* The CONTRAPOSITIVE of this implication is ꞀQ→ꞀP

If it is not divisible by 2, then it is not an even number
 P Q P→Q
True True True
True False False
False True True
False False True

*
* Let P and Q be the statement. The statement
“P if and if only Q” is called the biimplication
or biconditional of P and Q. The biconditional
“P if and only if Q” is written P↔Q
* Example
Paola is happy only if she paints a picture

*
 P Q P↔Q
True True True
True False False
False True False
False False True