DISCRETE | | LESSON 2 - 2.

1
FUNDAMENTALS OF PROPOSITIONAL LOGIC
♡ Propositional Logic is a part of logic which
deals with statements that are either true or
false (but not both).
♡ Statement is a declarative sentence that can be ♡ Not a Statement (Set Logic)
True (1) or False (0). Example of a statement:
- Golden State Warriors was 2017 NBA
Champions.
- 2 + 2 = 3.
♡ Not a Statement are Questions, Imperatives. ♡ Symbols and Statement: in Symbolic Logic, we
Example of not a statement: use lowercase letters such as p, q, r and s to
- Can I come in? represent statements.
- Is it Friday?
♡ Logic is the study of the principles and methods
used in distinguishing valid arguments from
those that are invalid. It is the basis of all
mathematical reasoning and of all automated
reasoning. It has practical applications to the ♡ Negating Statements: The negation of a true
design of computing machines, to the statement is a false statement and the negation
specification of systems, to artificial of a false statement is a true statement.
intelligence, to computer programming, to
program languages, and other areas of
computer science.
♡ Proposition is a declarative sentence (that is, a
sentence that declares a fact) that is either true
or false.
♡ Simple Statements is the basic building block
- Negation Symbol (¬)
in logic is the statement, also referred to as a
The logical negation symbol is used in
proposition. A statement is a declarative
Boolean algebra to indicate that the
sentence which can only be either true or false.
truth value of the statement that follows
♡ Compound Statements is the combination of
is reversed. The symbol (¬) resembles a
two or more simple statements is a compound
dash with a tail or the upper half of a
statement, or compound proposition. Example
rectangle.
of Compound Statement
SIMPLE AND COMPOUND STATEMENTS
- Example 10: “2 + 1 = 5” and “6 + 2 = 8”
- Example 11: “The sky is clear” or “It is
raining today” Simple Compound
♡ Truth Tables since a statement can only be true
Convey one idea with no Statements which
or false, the values of a statement can be connecting words combine two or more
represented by a truth table. Using the simple statements using
variables p and q to represent statements, and 1. Today is Monday connectives
letting T and F stand for true and false 2. The baby is eating an
respectively yields table 1, a truth table. apple Ex. of connectives
and
SET LOGIC
or
♡ Statement (Set Logic) : is a declarative If then
sentence that can be True (1) or False (0). If and only if

Salvadora, Nica Isabele T. | ITE101

 DISCRETE | | LESSON 2 - 2.1
CONJUNCTION / AND STATEMENT ♡ The statement before the → is called the
♡ If p and q are two simple statements, then the antecedent
compound statement p and q is symbolized by ♡ The statement after the → is called the
p ∧ q. consequent

CONDITIONAL/IF-THEN

CONJUNCTION / AND p q p→q

p q p∧q T T T

T T T T F F

T F F F T T

F T F F F T

F F F Note: It is only false if p is true and q is false, the rest of

the times is true.
BICONDITIONAL / IF AND ONLY IF STATEMENT
DISJUNCTION / OR STATEMENT
♡ Statements that are true if the statement is still
♡ It is a compound statement formed using the
true when the antecedent and consequent are
inclusive or represented by the symbol ∨
reversed - ↔

DISJUNCTION / OR

p q p∨q CONDITIONAL/IF AND ONLY IF

T T T p q p <-> q

T F T T T T

F T T T F F

F F F F T F

F F T
CONDITIONAL / IF-THEN STATEMENT
♡ The compound statement “If p, then q is
symbolized by p → q
♡ antecedent → consequent

Salvadora, Nica Isabele T. | ITE101

 DISCRETE | | LESSON 2 - 2.1
STATEMENTS OF SYMBOLIC LOGIC

Name Symbolic Common

Form English
Translation

Negation Not p

Conjunction p∧q p and q

Disjunction p∨q p or q

Conditional p→q If p then q

Biconditional p↔q p if and only if q

Salvadora, Nica Isabele T. | ITE101