Scribd
Upload
27 views26 pages

Cpe Dma Lec06

Uploaded by

Rocxel Roi Puso
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
27 views26 pages

Cpe Dma Lec06

Uploaded by

Rocxel Roi Puso
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/ 26

LOGIC AND

Lecture 06
PROPOSITIONAL
CALCULUS

CPE-DMA
Engr. Christopher B. Escarez, PCpE
OUTLINE
LOGIC AND PROPOSITIONAL CALCULUS
 Introduction
 Proposition and Compound Statements
 Basic Logical Operations
 Propositions and Truth Tables
 Tautologies and Contradictions
 Logic Equivalence
 Algebra of Propositions
 Conditional and Biconditional Statements
 Arguments
 Propositional Functions, Quantifiers
 Negation of Quantified Statements
INTRODUCTION

LOGIC
 Proof

PROPOSITIONAL CALCULUS
 Logic using a formal system
 Finite set of symbols
 Grammar (syntax)
 Set of rules
PROPOSITIONS AND COMPOUND STATEMENTS

PROPOSITION (Statement)
 Declarative statement which is TRUE or FALSE
but not both
(a) Ice floats in water. (b) China is in Europe.
(c) 2 + 2 = 4 (d) 2 + 2 = 5
(e) Where are you going? (f ) Do your homework.
Only the first four are propositions
(a) and (c) are TRUE, but (b) and (d) are FALSE
PROPOSITIONS AND COMPOUND STATEMENTS

COMPOUND STATEMENTS (Composite)


 Composed of subpropositions with various
connectives
CONNECTIVES

(g) Roses are red and violets are blue


(h) John is smart or he studies every night.
 Primitive – cannot be broken down into simpler
propositions
BASIC LOGICAL OPERATIONS
CONJUNCTION
 Compound proposition combined with “and”
DISJUNCTION
 Compound proposition combined with “or”
NEGATION
 Putting “not” in a proposition

Truth value depends only on the truth values of two


propositions
BASIC LOGICAL OPERATIONS
CONJUNCTION
p ∧ q p and q

If p and q are true,


then p ∧ q is true;
otherwise p ∧ q is false.
BASIC LOGICAL OPERATIONS
CONJUNCTION: EXAMPLE
 Ice floats in water and 2 + 2 = 4. TRUE
 Ice floats in water and 2 + 2 = 5. FALSE
 China is in Europe and 2 + 2 = 4. FALSE
 China is in Europe and 2 + 2 = 5. FALSE
BASIC LOGICAL OPERATIONS
DISJUNCTION
p ∨ q p or q

If p and q are false,


then p ∨ q is false;
otherwise p ∨ q is true.
BASIC LOGICAL OPERATIONS
DISJUNCTION: EXAMPLE
 Ice floats in water or 2 + 2 = 4. TRUE
 Ice floats in water or 2 + 2 = 5. TRUE
 China is in Europe or 2 + 2 = 4. TRUE
 China is in Europe or 2 + 2 = 5. FALSE
BASIC LOGICAL OPERATIONS
NEGATION
 ¬p not p

If p is true, then ¬p is false;


and if p is false, then ¬p is true.
BASIC LOGICAL OPERATIONS
NEGATION: EXAMPLE
 It is false that ice floats in water. FALSE
 Ice does not float in water. FALSE
 It is false that 2 + 2 = 5. TRUE
2 + 2 ≠ 5 TRUE
BASIC LOGICAL OPERATIONS
LOGICAL NOTATION
 AND
p&q p∙q pq p∧q
 OR
p+q p∨q
 NOT
p' p ~p ¬p
PROPOSITIONS AND TRUTH TABLES
Proposition are constructed with logical variables
that take on the value of TRUE or FALSE with logical
connectives
 ¬(p ∧ ¬q)
TAUTOLOGIES ANG CONTRADICTIONS
TAUTOLOGIES
 Propositions whose truth values in the truth table
are all TRUE

CONTRADICTIONS
 Propositions whose truth values in the truth table
are all FALSE
TAUTOLOGIES ANG CONTRADICTIONS

TAUTOLOGIES CONTRADICTIONS

One is the negation of the other


LOGICAL EQUIVALENCE
Two propositions are logically equivalent if they have
the same truth table.
¬(p ∧ q)≡ ¬p ∨ ¬q
ALGEBRA OF PROPOSITIONS
IDEMPOTENT LAWS
p∨ p p p∧ p p
ASSOCIATIVE LAWS
(p ∨ q) ∨ r p ∨ (q ∨ r) (p ∧ q) ∧ r p ∧ (q ∧ r)
COMMUTATIVE LAWS
p∨ q q∨ p p∧ q q∧ p
DISTRIBUTIVE LAWS
p ∨ (q ∧ r) (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) (p ∧ q) ∨ (p ∧ r)
ALGEBRA OF PROPOSITIONS
IDENTITY LAWS
p∨ F p , p∨ T T p∧ T p , p∧ F F
INVOLUTION LAWS
¬¬p p
COMPLEMENT LAWS
p ∨ ¬p T , ¬T F p ∧ ¬p F , ¬F T
DeMORGAN’S LAWS
¬(p ∨ q) ¬p ∧ ¬q ¬(p ∧ q) ¬p ∨ ¬q
ARGUMENTS
ARGUMENT
 Assertion that a given set of propositions called premises
yields another proposition called the conclusion
 P 1 , P 2 , . . ., P n ├ Q

 LOGICAL ARGUMENT or VALID ARGUMENT


 Conclusion is true whenever all the premises are true

 FALLACY

CONDITIONAL AND BICONDITIONAL STATEMENTS

CONDITIONAL STATEMENTS
 p→q p only if q
false only when the first part p is true
and the second part q is false
BICONDITIONAL STATEMENTS
 p↔q p if and only if q
true whenever p and q have the same
truth values and false otherwise
PROPOSITIONAL FUNCTIONS, QUANTIFIERS

PROPOSITIONAL FUNCTION
 Function p(x) that has a truth value whenever an element
a ∈ A is substituted for the variable x
EXAMPLE
Let p(x) be “x + 2 > 7” True for all integers > 5
“x + 5 < 3” Not true for any integer in N
“x + 5 > 1” True for every element in N
“x + 1 = 2” True if and only if x is 1
PROPOSITIONAL FUNCTIONS, QUANTIFIERS

UNIVERSAL QUANTIFIER ( ∀ )
 For every x in A, p(x) is a true statement
 ( ∀ x ∈ A)p(x) or ( ∀ x ∈ A)p(x)
EXAMPLE
Proposition ( ∀ n ∈ N)(n + 4 > 3)
True since {n | n + 4 > 3} = {1, 2, 3,...} = N.
( ∀ n ∈ N)(n + 2 > 8)
False since {n | n + 2 > 8} = {7, 8, 9,...} ≠ N.
PROPOSITIONAL FUNCTIONS, QUANTIFIERS

EXISTENTIAL QUANTIFIER ( ∃ )
 There exist an x in A such that p(x) is true
 Tp = {x | x ∈ A, p(x)} ≠ Ø
EXAMPLE
Proposition ( ∃ n ∈ N)(n + 4 < 7)
True since {n | n + 4 < 7} = {1, 2} ≠ Ø.
( ∃ n ∈ N)(n + 6 < 4)
False since {n | n + 6 < 4} = Ø.
NEGATION OF QUANTIFIED STATEMENTS
DEMORGAN’S LAW
 ¬( ∀ x ∈ A)p(x) (∃ x ∈ A)¬p(x)
 It is not true that, for all a ∈ A, p(a) is true.
 There exists an a ∈ A such that p(a) is false .

 ¬(∃ x ∈ A)p(x) ( ∀ x ∈ A)¬p(x)


 It is not true that, for some a ∈ A, p(a) is true.
 For all a ∈ A, p(a) is false .
SEATWORK # 2

PROVIDE THE TRUTH TABLE OF


THE FOLLOWING PROPOSITIONS

1)(p ∨ ¬q)∧ ¬r
2)¬(¬a ∧ b) ∨ (c ∧ d)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy