Scribd
Upload
558 views12 pages

Logical Connectives

This document defines logical connectives and quantifiers that are used in mathematical reasoning and logic. It provides definitions and truth tables for logical operators such as negation, conjunction, disjunction, implication, biconditional, and equivalence. It also defines universal and existential quantification and provides examples of translating statements into symbolic logic using quantifiers and logical connectives.

Uploaded by

Mark Jovince Cardenas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
558 views12 pages

Logical Connectives

This document defines logical connectives and quantifiers that are used in mathematical reasoning and logic. It provides definitions and truth tables for logical operators such as negation, conjunction, disjunction, implication, biconditional, and equivalence. It also defines universal and existential quantification and provides examples of translating statements into symbolic logic using quantifiers and logical connectives.

Uploaded by

Mark Jovince Cardenas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

LOGICAL

CONNECTIVES
LOGICAL CONNECTIVES
• LOGIC IS THE BASIS OF ALL MATHEMATICAL REASONING,
ALL IT HAS PRACTICAL APPLICATIONS TO THE DESIGN OF
COMPUTING MACHINES, TO ARTIFICIAL INTELLIGENCE, TO
COMPUTER PROGRAMMING, TO PROGRAMMING
LANGUAGES, AND TO OTHER AREAS OF COMPUTER
SCIENCE.
• IN THE DEVELOPMENT OF ANY MATHEMATICAL THEORY,
ASSERTIONS ARE MADE IN THE FORM OF SENTENCES.
SUCH VERBAL OR WRITTEN ASSERTIONS, CALLED
STATEMENTS OR PROPOSITIONS.
LOGICAL CONNECTIVES
• DEFINITION 1. A PROPOSITION IS A STATEMENT WHICH
IS EITHER TRUE OR FALSE BUT NOT BOTH.
• DEFINITION 2. A PROPOSITIONAL VARIABLE DENOTES
AN ARBITRARY PROPOSITION WITH AN UNSPECIFIED
TRUTH VALUE.
NOTATION: A, B, . . . , P, Q, R
• LOGICAL OPERATORS
WE WILL GENERALLY USE HERE STANDARD
CONNECTIVE SYMBOLS SUCH AS THE FOLLOWING:
Connective Symbol Mathematical Term
Not  Negation
And  Conjunction
Or  Disjunction
If… then…  Conditional or Implication
If and only if  Biconditional or Material
Equivalence
LOGICAL CONNECTIVES
• DEFINITION 3. A PROPOSITIONAL FORM IS AN
ASSERTION WHICH CONTAINS AT LEAST ONE
PROPOSITIONAL VARIABLE, OR A SEQUENCE OF
SYMBOLS CONTAINING PROPOSITIONAL VARIABLES AND
LOGICAL OPERATORS.
EXAMPLE: P PQ PQ
 P IF P THEN Q P IF AND ONLY IF Q
• DEFINITION 4. THE PROPOSITION “NOT P”
REPRESENTED BY “ P” DENOTES A NEGATION OF P.
OTHER WAYS OF STATING: 1) IT IS NOT THE CASE THAT,
P P
2) IF IS FALSE THAT T F
F T
LOGICAL CONNECTIVES
• DEFINITION 5. THE PROPOSITION “P AND Q” DENOTED
BY THE SYMBOLS “P  Q” IS CALLED THE CONJUNCTION
OF P AND Q, OTHER WAYS OF EXPRESSING IT:
(MOREOVER, YET, STILL, FURTHER, NEVERTHELESS,
HOWEVER, ALSO, AND ALTHOUGH)
P Q PQ
T T T
T F F
F T F
F F F
LOGICAL CONNECTIVES
• DEFINITION 6. THE PROPOSITION “P OR Q” DENOTED
BY “P  Q” IS CALLED THE DISJUNCTION. OTHER WAYS: P
LESS Q P Q PQ
T T T
T F T
F T T
F F F
LOGICAL CONNECTIVES
• DEFINITION 7. THE PROPOSITION “P IMPLIES Q”
DENOTED BY THE SYMBOL “P  Q” IS CALLED AN
IMPLICATION OR CONDITIONAL STATEMENT. P IS CALLED
THE ANTECEDENT PREMISE OR HYPOTHESIS. Q IS
CALLED THE CONCLUSION OR CONSEQUENT. OTHER
WAYS: (IF P THEN Q, P ONLY IF Q, Q IF P, P IS A
SUFFICIENT CONDITION FOR Q, Q IS NECESSARY
CONDITION FORPP, Q FOLLOWSQ
FROM P, Q WHENEVER P,
PQ
Q PROVIDED P) T T T
T F F
F T T
F F T
LOGICAL CONNECTIVES
• DEFINITION 8. THE PROPOSITION “P IF AND ONLY IF Q”
DENOTED BY “P  Q” IS CALLED THE MATERIAL
EQUIVALENT OR BY CONDITIONAL OF TWO
PROPOSITIONS P AND Q. OTHER WAYS: (P IS SUFFICIENT
AND NECESSARY CONDITION FOR Q, P IS MATERIALLY
EQUIVALENT TO P
Q” Q PQ
T T T
T F F
F T F
F F T
EXAMPLE
WRITE THE FOLLOWING IN SYMBOLIC FORM USING P, Q AND R
FOR STATEMENTS AND THE SYMBOLS , , , ,  WHERE
P: PRES. DUTERTE IS A GOOD PRESIDENT.
Q: GOVERNMENT OFFICIALS ARE CORRUPT.
R: PEOPLE ARE HAPPY.
a. IF PRES. DUTERTE IS A GOOD PRESIDENT, THEN
GOVERNMENT OFFICIALS ARE PNOT
Q CORRUPT.
b. IF GOVERNMENT OFFICIALS ARE NOT CORRUPT, THEN THE
PEOPLE ARE HAPPY
Q  R .
c. IF PRES. DUTERTE IS A GOOD PRESIDENT AND PEOPLE ARE
HAPPY, THEN GOVERNMENT OFFICIALS ARE
PR NOT CORRUPT.
 Q
d. PRES. DUTERTE IS NOT A GOOD PRESIDENT IF AND ONLY IF
GOVERNMENT OFFICIALS ARE CORRUPT AND THE PEOPLE
ARE NOTP
HAPPY.  R)
 (Q
CONVERSE, INVERSE, CONTRAPOSITIVE
SUPPOSE P AND Q ARE PROPOSITIONS, GIVEN THE
IMPLICATION P  Q. ITS CONVERSE IS Q  P, ITS INVERSE
IS P  Q AND ITS CONTRAPOSITIVE IS Q  P.
THIS IS,
GIVEN : IF P THEN Q
INVERSE : IF NOT P THEN NOT Q
CONVERSE : IF Q THEN P
CONTRAPOSITIVE : IF NOT Q THEN NOT P
QUANTIFIERS
QUANTIFIERS ARE USED TO DESCRIBE THE
VARIABLE(S) IN A STATEMENT. (THIS IS ALSO ANOTHER
WAYS OF QUANTIFYING A PROPOSITIONAL FUNCTION
1. UNIVERSAL QUANTIFICATION – IS THE ASSERTION
“FOR ALL X, P(X)” DENOTED BY ∀X FOR ALL X P(X)
2. 2. EXISTENTIAL QUANTIFICATION – IS THE

ASSERTION “FOR SOME X, P(X) DENOTED BY ∃X FOR


SOME P(X)”
EXAMPLE: TRANSLATE THE FOLLOWING STATEMENT

LET: R(X)=ROOM A(X) = AIRCON


1. ALL ROOMS ARE EITHER AIRCON OR NOT.
∀X[R(X) ⇒ (A(X)  ¬A(X))]
2. SOME SENATORS ARE EITHER DISLOYAL OR MISGUIDED.
∃X[S(X)  (D(X)  M(X))]
3. GUAVAS AND BANANAS ARE NOURISHING.
∀X[G(X)  (B(X) ⇒ N(X)]
4. EVERY REAL NUMBER IS RATIONAL OR IRRATIONAL
∀X[R(X) ⇒ Q(X)  ¬Q(X)]
5. THE ONLY UNSIGNED REAL NUMBER IS 0.
∀X[R(X)  � (X) ⇒ X=0]

You might also like