DISCRETE

MATHEMATICS

Compiled and Prepared

by:
Engr. Luigi Carlo M. De
Jesus

PROPOSITIONAL LOGIC
A proposition is a statement that is either true
or false
Every proposition is true or false, but its truth
value may be unknown
Propositions and operators can be combined
into compound propositions.

LOGICAL OPERATORS
logical not (negation)
logical or (disjunction)
logical and (conjunction)
logical exclusive or
logical implication (conditional)
logical bi-implication (biconditional)

ENGLISH TO PROPOSITIONAL
LOGIC
English:
If the car is out of gas, then it will stop
Logic:
p equals the car is out of gas q equals the car will
stop
pq

PROPOSITIONAL LOGIC TO
ENGLISH
Logic:
q

p equals it is raining q equals the grass will be wet p

English:
If it is raining, the grass will be wet.

LOGICAL EQUIVALENCES:
DEFINITION
Certain propositions are equivalent (meaning they share
exactly the same truth values)
Duality Law

(p^q)vT

Domination Laws

(pvq)^F
T (p q) (p q)
F (p q) F

LOGICAL EQUIVALENCES:
PROVING
Prove: p (p q)
p (p q)

(p q)

(p p) (p q)

T (p q)
(p q)
(p q)

Distributive law

Negation law

Domination law

De Morgans Law

VOCABULARY
A tautology is a compound proposition that is
always true.
A contradiction is a compound proposition
that is always false.
A contingency is neither a tautology nor a
contradiction.

RULES OF INFERENCE:
DEFINITION
A rule of inference is a proven relation: when the left
hand side (LHS) is true, the right hand side (RHS) is
also true.

RULES OF INFERENCE:
EXAMPLE
Modus Ponens: If p, and p implies q, then q
Example:
p = it is sunny, q = it is hot
p q, it is hot whenever it is sunny
Given the above, if it is sunny, it must be hot.

RULES OF INFERENCE:
EXAMPLE
Modus Tollens: If not q and p implies q, then not p
Example:
p = it is sunny, q = it is hot
p q, it is hot whenever it is sunny
Given the above, if it is not hot, it cannot be sunny.

FUNCTION: TYPES
One to One Function or Injective
every element of the codomain is mapped to byat
mostone element of
the domain

Onto Function or Surjective

every element of the codomain is mapped to by at least
one element of the domain

One to One and Onto function or Bijective

every element of the codomain is mapped to
byexactlyone element of the domain

RELATION: TYPES
Reflexive xRx yRy
Symmetric xRy yRx
Antisymmetric
Transitive xRy yRz xRz

RELATION: TYPES
Asymmetric
Transitive and Irreflexive

Partial Ordered Relation

Transitive, Reflexive and Antisymmetric
Equivalence Relation
Transitive, Reflexive and Symmetric

EULER PATH
apaththat uses every edge of a graph exactly once.

THANK YOU