0% found this document useful (0 votes)
23 views19 pages

LEC04-Proposition Logic and Predicate Logic - DSGT

The document discusses propositional and predicate logic, outlining various laws of logic such as DeMorgan's Law, Commutative Law, and Absorption Law. It highlights the limitations of propositional logic in expressing certain statements and introduces predicates as sentences with unspecified variables. Examples are provided to illustrate the application of these concepts in logical expressions and their simplifications.
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
0% found this document useful (0 votes)
23 views19 pages

LEC04-Proposition Logic and Predicate Logic - DSGT

The document discusses propositional and predicate logic, outlining various laws of logic such as DeMorgan's Law, Commutative Law, and Absorption Law. It highlights the limitations of propositional logic in expressing certain statements and introduces predicates as sentences with unspecified variables. Examples are provided to illustrate the application of these concepts in logical expressions and their simplifications.
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/ 19

Praposition Logic & Predicate Logic

(Lec 4)

CE – SE – DSGT
Sunil K Punjabi
Assistant Professor
Computer Engineering Department,
SIES Graduate School of Technology

Sunil K Punjabi
Laws of Logic
¬ (¬ P) ↔ P
Idempotent Law:
P V P ↔ P, P∧P↔P
Commutative Law:
P V Q ↔ Q V P, P ∧ Q ↔ Q ∧ P
Associate Law:
(P V Q) V R ↔ P V (Q V R) (P ∧ Q) ∧ R ↔ P ∧ (Q ∧ R)
Distributive Law:
P V (Q ∧ R) ↔ (P V Q) ∧ (P V R)
P ∧ (Q V R) ↔ (P ∧ Q) V (P ∧ R)
DeMorgan’s Law:
¬(P V Q) ↔ ¬P ∧ ¬Q
¬ (P ∧ Q) ↔ ¬P V ¬Q
Conditional is equivalent to its Contrapositive
(P → Q) ↔ (¬Q → ¬P)
Identity Laws
P V False ↔ P P V True ↔ True
P ∧ False ↔ False P ∧ True ↔ P
Sunil K Punjabi 2
Complement Laws
P V ¬P = True P ∧ ¬ P = False

Implication Law
P→Q=¬PVQ

Absorption Law
P ∧ (P V Q) = P P V (P ∧ Q) = P

Sunil K Punjabi 3
Following are Absorption Laws
Example 8: i) Show that a v (a ᴧ b) = a
Soln: Using Identity Law,
a v (a ᴧ b) = (a ᴧ T) v (a ᴧ b), where T = True
Again, a v (a ᴧ b) = a ᴧ (T v b)………….. Distributive Law
= a ᴧ T………………….. Identity Law
= a…………………………. Identity Law
ii) Show that a ᴧ (a v b) = a
Using Identity Law,
a ᴧ (a v b) = (a ᴧ T) ᴧ (a v b), where T = True
Again, a ᴧ (a v b) = a ᴧ (T v b)………….. Distributive Law
= a ᴧ T………………….. Identity Law
= a…………………………. Identity Law
Sunil K Punjabi 4
Example 9: i) Show that P V (¬P ∧ Q) = P V Q
P V (¬P ∧ Q) = (P V ¬P) ∧ (P V Q) …………..
Distributive Law
= T ∧ (P V Q) ……………………... Compliment
Law
= P V Q ……………………............ Identity Law

ii) Show that P ∧ (¬P V Q) = P ∧ Q


P ∧ (¬P V Q) = (P ∧ ¬P) V (P ∧ Q) …………..
Distributive Law
= F V (P ∧ Q) ……………………... Compliment
Law
= P ∧ Q ……………………............ Identity Law

Sunil K Punjabi 5
Example 10: Simplify the expression: P V ¬(¬P → Q)
P V ¬(¬P → Q) = P V ¬(¬ ¬P V Q) -Implication Law
= P V ¬(P V Q) -Complement Law
= P V (¬P ∧ ¬Q) -
DeMorgan’ Law
= (P V ¬P) ∧ (P V ¬Q) -Distributive Law
= T ∧ (P V ¬Q) -Complement Law
= (P V ¬Q) ∧ T -Commutative
Law
=PV¬Q -Identity
Law

Sunil K Punjabi 6
Sunil K Punjabi 7
Example 11

Sunil K Punjabi 8
Sunil K Punjabi
Sunil K Punjabi
Sunil K Punjabi
Sunil K Punjabi
Sunil K Punjabi
Sunil K Punjabi
Limitations of Propositional Logic
Propositional logic cannot adequately express the meaning of a given
statements. For Eg: “Every computer connected to the institute’s
network, works fine.”
Here, the propositional logic fails to explain the complete meaning
of the statement by not defining the word, ‘Every’.
Similarly, in the statement, “Computer CS-2 is under attack.”, the
propositional logic fails to determine which computer is under
attack.

Sunil K Punjabi 15
Predicates
A Predicate is a sentence containing variable/variables whose values
are not specified. For Eg:
a) X2 + Y2 = Z2
b) A servant loves to watch a movie.
Here, X, Y, Z, servant and movie are variables.
The statement “X is greater than 3” has twp parts:
i) The variable, X is a subject
ii) “is greater than 3” is a predicate
As soon as the variables are replaced y the specified values, the
predicate becomes a statement having a fixed truth value, T or F.
The set of values, which upon replacement of a variable, converts a
predicate into a statement is called the universe of discourse or
simply the universe U w.r.t that
Sunil variable.
K Punjabi 16
A predicate having n variables x1, x2,…..,xN is called n-place predicate

and is denoted by P(x1, x2,…..,xn ). For Eg:

a) P(x,y): X2 + Y2 = 16
Here, the universe may be taken as R
b) Q(s,f): A servant loves a fruit.
Here, s and f are the variables representing servant and fruit
respectively. The universe for s is the set of all servants and f is the
set of all the fruits.
c) R(a,b): a dislikes b
Here, universe U is the set of all living beings.

Sunil K Punjabi 17
Example 12: Let P(x) denote the statement “x > 3.” What are the truth
values of P(4 and P(2)?
Soln: a) P(4), putting x = 4, we get 4 > 3, which is true.
b) P(2), putting x = 2, we get 2 > 3, which is false
Similarly,
a) Let, P(x,y): X2 + Y2 = 16.
For P(3,5), we get 32 + 52 = 16, which is a false statement.
b) Let, Q(s,f): Ramu loves an apple.
Here, the truth value depends upon whether this particular servant
loves an apple or not.

Sunil K Punjabi 18
Thank You!
([email protected])

19
Sunil K Punjabi

You might also like