Академический Документы
Профессиональный Документы
Культура Документы
Lecture 2
Compound Propositions
Producing new propositions from existing propositions.
1. Not
2. And ˄
3. Or ˅
4. Exclusive or
5. Implication
6. Biconditional
2
Compound Propositions
Negation of a proposition
Let p be a proposition. The negation of p, denoted by
p (also denoted by ~p), is the statement
p : Today is Friday.
The negation is
p : It is not the case that today is Friday.
“6 is negative”.
The negation is
p p
true false
false true
Definition
Let p and q be propositions. The conjunction
of p and q, denoted by p˄q, is the proposition
“p and q”.
The conjunction p˄q is true when p and q are
both true and is false otherwise.
p : Today is Friday.
q : It is raining today.
The conjunction is
p q pq
true true true
true false false
false true false
false false false
Definition
Let p and q be propositions. The disjunction
of p and q, denoted by p˅q, is the proposition
“p or q”.
The disjunction p˅q is false when both p and
q are false and is true otherwise.
p : Today is Friday.
q : It is raining today.
The disjunction is
p q pq
true true true
true false true
false true true
false false false
Definition
Let p and q be propositions. The exclusive or
of p and q, denoted by pq, is the proposition
“pq”.
The exclusive or, p q, is true when exactly
one of p and q is true and is false otherwise.
p q p q (p)(q)
true true false false false
true false false true true
false true true false true
false false true true true
In logic form
p(pq)
P Q P Q (P)(Q)
true true false false false
true false false true true
false true true false true
false false true true true
• Examples:
• R(R)
• (PQ) (P)(Q)
• If S T is a tautology, we write S T.
• If S T is a tautology, we write S T.
Examples
• R(R)
• ((PQ)(P)(Q))
• The negation of any tautology is a contradiction, and
the negation of any contradiction is a tautology.
Definition
Two proposition form are called logically equivalent if
and only if they have identical truth values for each
possible substitution of propositions for their
proposition variable.
Solution
p ¬p ¬ (¬p)
T F T
F T F
1. ¬(pq) ≡ ¬p¬q
2. ¬(pq) ≡ ¬p¬q
-1< x 4
Solution: The given proposition is equivalent to
-1 < x and x 4,
By De Morgan’s laws, the negation is
-1 ≥ x or x > 4.
Discrete Structures(CS 335) 39
Tautology and Contradiction
p ¬p p ¬p p ¬p
T F T F
F T T F
1. Commutative laws
pq ≡ qp ; pq ≡ qp
2. Associative laws
p (q r) ≡ (p q) r ; p(q r) ≡ (pq)r
3. Distributive laws
p (q r ) ≡ (p q) (p r)
p (q r) ≡ (p q) (p r)
4. Identity laws
p t ≡ p ; pc ≡ p
5. Negation laws
p¬p ≡ t ; p ¬p ≡ c
7. Idempotent laws
p p ≡ p ; pp ≡ p
Discrete Structures(CS 335) 43
Laws of Logic
8. Universal bound laws
pt≡t ;pc≡ c
9. Absorption laws
p (pq) ≡ p ; p (p q) ≡ p
• Logical Connectives
• Truth Tables
• Compound propositions
• Translating English to logic and logic to English.
• Logical Equivalence
• Equivalence Check
• Tautologies and Contradictions
• Laws of Logic
• Simplification ofDCiscoremteSptroucutunreds(CPS3r3o5p) ositions 48