Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 31

DISCRETE MATHEMATICS

Proposition & Logical


Connectives
Luzviminda T. Orilla, PhD
TOPIC 1

PROPOSITION
What is meant by Statement (Proposition)?

IT IS A DECLARATIVE SENTENCE WHICH IS EITHER TRUE


OR FALSE, BUT NOT BOTH.

THE TRUTH VALUE OF THE STATEMENTS IS THE TRUTH


AND FALSITY OF THE STATEMENT.
EXAMPLE

• Which of the following are statements?


Manila is the capital of the It is true. Thus, it is a
Philippines. statement.

What day is it today? It is a question. It cannot be


considered as either true or
false and therefore, not a
statement
More Example

• Which of the following are statements?


Help me, please. It cannot be categorized as
true or false; hence, not a
statement.

He is handsome. The sentence is neither true


or false because “he” is not
specified and thus, it is not a
statement.
Topic 2
LOGICAL CONNECTIVES
What is Logic?

IT IS “THE SCIENCE OR STUDY OF HOW TO EVALUATE


ARGUMENTS AND REASONING”

OTHERS DEFINED IT AS “DISCIPLINE THAT DEALS WITH


THE METHODS OF REASONING”.

LOGICAL REASONING IS USED ON MATHEMATICS TO


PROVE THEOREMS, IN COMPUTER SCIENCE --- TO VERIFY
THE CORRECTNESS OF PROGRAMS AND TO PROVE
THEOREMS.
What is Mathematical Logic?

• It is a branch of Mathematics with close connections to


computer science.
• It includes both the mathematical study of logic and
the applications of formal logic to other areas of
mathematics.
• It includes the study of the deductive formal proofs
systems and expressive formal systems.
• It has four divisions: Set Theory, Model Theory,
Recursion Theory and Proof Theory.
Logical Connectives

A PROPOSITIONAL VARIABLE IS A VARIABLE WHICH USED


TO REPRESENT A STATEMENT.

A FORMAL PROPOSITIONAL WRITTEN USING LOGIC


NOTATION, p, q, r, ARE USED TO REPRESENT STATEMENT.

A COMPOUND STATEMENT IS A STATEMENT COMPOSED OF


TWO OR MORE SIMPLE STATEMENTS CONNECTED BY
LOGICAL CONNECTIVES “and”, “or”, “if then”, “if and
only if”, and “exclusive-or”.
SIX MAIN LOGICAL CONNECTIVES

CONJUNCTION DISJUNCTION

NEGATION CONDITIONAL

BICONDITIONAL EXCLUSIVE-OR
CONJUNCTION

THE CONJUNCTION OF THE STATEMENT P AND Q IS THE


COMPOUND STATEMENT “ P AND Q“.
In SYMBOL, P  Q, where  is the symbol for “and”.

Property 1: If P is true and q is true, then p  q is true;


otherwise p  q is false. Meaning , the conjunction of
two statements is true only if each statement is true.
TRUTH VALUE FOR CONJUNCTION

P Q PQ
T T T
T F F
F T F
F F F
DISJUNCTION

THE DISJUNCTION OF THE STATEMENT P, Q IS THE COMPOUND


STATEMENT “P OR Q”.
SYMBOLICALLY, P  Q, WHERE  IS THE SYMBOL ‘OR’.

PROPERTY 2. IF P IS TRUE OR Q IS TRUE OR BOTH P OR Q ARE


TRUE, THEN P  Q IS TRUE; OTHERWISE P  Q IS FALSE.
MEANING THE DISJUNCTION OF TWO STATEMENTS IS FALSE
ONLY IF EACH STATEMENT IS FALSE.
TRUTH TABLE FOR DISJUNCTION

P Q PQ
T T T
T F T
F T T
F F F
NEGATION

THE NEGATION OF THE STATEMENT P IS DENOTED BY


P, WHERE  IS THE SYMBOL FOR “NOT’.

PROPERTY 3: IF P IS TRUE, P IS FALSE. MEANING THE TRUTH


VALUE OF THE NEGATION OF A STATEMENT IS ALWAYS THE
REVERSE OF THE TRUTH VALUE OF THE ORIGINAL
TRUTH VALUE OF NEGATION

P P
T F
F T
EXAMPLE

P P
1. 3 + 5 = 8. 1. 3 + 5  8.
2. John is not here. 2. John is here.
3. He loves me. 3. He loves me not.
CONDITIONAL

THE CONDITIONAL (OR IMPLICATION) OF THE STATEMENT P


AND Q IS THE COMPOUND STATEMENT “IF P THEN Q”.
SYMBOLICALLY, P  Q, WHERE  IS THE SYMBOL FOR “ IF
THEN”.
P IS CALLED HYPOTHESIS (OR ANTECEDENT OR PREMISE) AND Q
IS CALLED CONCLUSION (OR CONSEQUENT OR CONSEQUENCE).

PROPERTY 4: THE CONDITIONAL STATEMENT P Q IS FALSE


ONLY WHEN P IS TRUE AND Q IS FALSE; OTHERWISE P  Q IS
TRUE. MEANING P  Q STATES THAT A TRUE STATEMENT
CANNOT IMPLY A FALSE STATEMENT.
TRUTH VALUE FOR CONDITIONAL

P Q P Q
T T T
T F F
F T T
F F T
EXAMPLE (Obtain the truth value)

P Q PQ
1. IF VINEGAR IS SWEET, THEN SUGAR IS SOUR. True
(False) (False)

2. 2 + 5 =7 is a for 5 + 6 = 1 False
sufficient condition (False)
(True)
3. 14 - 8 = 4 is That 6  3 = 2 True
necessary condition (True)
( False)
BICONDITIONAL

THE BICONDITIONAL OF THE STATEMENT P AND Q IS THE


COMPOUND STATEMENT “P IF AND ONLY IF Q”.
SYMBOLICALLY, P  Q, WHERE  IS THE SYMBOL FOR “IF
AND ONLY IF”.

PROPERTY 5: IF P AND Q ARE TRUE OR BOTH FALSE, THEN


P  Q IS TRUE; IF P AND Q HAVE OPPOSITE TRUTH VALUES,
THEN P  Q IS FALSE.
TRUTH TABLE FOR BICONDITIONAL

P Q PQ
T T T
T F F
F T F
F F T
EXAMPLE
DETERMINE THE TRUTH VALUES OF EACH OF THE FOLLOWING.

P Q PQ
1. 2 + 8 = 10 IF AND ONLY IF 6 -3 = 3. (true)
(true) (true)
2. 8 – 2 = 5 is sufficient and Necessary for (true)
(False) 4 + 2 = 7.
(False)
EXCLUSIVE-OR

THE EXCLUSIVE-OR OF THE STATEMENT P AND Q IS THE COMPUND


STATEMENT “P EXCLUSIVE-OR Q.”
SYMBOLICALLY, P  Q, WHERE  IS THE SYMBOL FOR “EXCLUSIVE-
OR.”

PROPERTY 6. IF P AND Q ARE TRUE OR BOTH FALSE, THEN P  Q IS


FALSE; IF P AND Q HAVE OPPOSITE TRUTH VALUES, THEN P  Q IS
TRUE.

ITCAN BE NOTED THAT THE TRUTH VALUES OF P  Q IS


THE NEGATION OF THE TRUTH VALUES OF P Q.
TRUTH VALUES FOR EXCLUSIVE-OR

P Q PQ
T T F
T F T
F T T
F F F
EXAMPLE

CONSTRUCT THE TRUTH TABLE FOR EACH OF


THE FOLLOWING COMPOUND STATEMENTS AND
DETERMINE WHETHER THE COMPOUND
STATEMENT IS TAUTOLOGY, CONTRADICTION
OR CONTINGENCY.
1. P  (  P  Q)
2. [ P  ( P  Q)]  Q
1.P  (  P  Q) - CONTINGENCY

P Q P PQ P  ( P  Q)
T T F F T
T F F T F
F T T T T
F F T F F
2.[ P  ( P  Q)]  Q - TAUTOLOGY

P Q PQ P  (P  Q) [ P  ( P  Q)]  Q

T T T T T
T F F F T
F T T F T
F F T F T
THREE IMPORTANT CLASSES OF COMPOUND
STATEMENTS

1. TAUTOLOGY 2. CONTRADICTION 3. CONTINGENCY


(LOGICALLY TRUE) (LOGICALLY FALSE
OR ABSURDITY) It can either be
True for all False for all true or false,
possible possible depending on the
combinations of combinations of truth values
the truth values the truth values
CONSTRUCT THE TRUTH TABLE FOR EACH OF
THE FOLLOWING STATEMENTS

1.  P  Q
2. P  (P   Q)
3. ( P  Q)  ( P   Q)
4. (P  Q)  ( Q   R)

You might also like