Scribd
Upload
22 views19 pages

Unit 1 - Predicate Calculus

Uploaded by

antoniyajeswin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views19 pages

Unit 1 - Predicate Calculus

Uploaded by

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

PREDICATE CALCULUS

(OR)
PREDICATE LOGIC
INTRODUCTION

• x > 10
• x+y=5
• x+y=z
These statements are either true or false, when
the values of the variables are not specified.

Course Instructor: Dr. A Kirupa 2


1) Consider the statement “x > 10”.
It has two parts:
• The first part the variable “x”, is the subject of the
statement.
• The second part “is greater than 10”, which refers to a
property that the subject can have, is called the predicate.
P denotes the predicate “is greater than 10”
The subject is denoted by the variable is “x”.
The proportional function is denoted by P(x).
P(x) becomes a proposition when values are assigned for the
variable x.
Example:
Find the truth values of P(15) & P(5).
Course Instructor: Dr. A Kirupa 3
INTRODUCTION
x > 10
• 𝑃(𝑥)
x+y=5
• 𝑃(𝑥, 𝑦)
x+y=z
• 𝑃(𝑥, 𝑦, 𝑧)

Course Instructor: Dr. A Kirupa 4


Predicate Logic (or) Predicate Calculus
PREDICATE LOGIC (OR) PREDICATE CALCULUS:
The logic based on the analysis of
predicates in any statement is called Predicate
Logic or Predicate Calculus.
PROPOSITIONAL LOGIC:
The symbolic analysis of ordinary
compound statements is called the Propositional
logic.

Course Instructor: Dr. A Kirupa 5


STATEMENT FUNCTIONS:
A simple statement function of one
variable is defined to be an expression
consisting of a predicate symbol and an
individual variable.
COMPOUND STATEMENT FUNCTION:
Compound Statement Function is obtained
by combining one or two more simple statement
functions using logical connective.

Course Instructor: Dr. A Kirupa 6


EXAMPLES
1. Ram is a boy.
r is the subject Ram.
B is the predicate.
It is denoted by B(r).
2. Raj is taller than Ramesh.
Two subjects: Raj as r and Ramesh as s.
Predicate: is taller than
It is denoted by T(r, s).
3. Sam is intelligent and Ram is poor.
I 𝑠 ∧𝑃 𝑟 .
4. Mr X sits between Mr Y & Mr Z.
𝑀 𝑥, 𝑦, 𝑧 . Course Instructor: Dr. A Kirupa 7
QUANTIFIER
Quantifier is the one which is used to quantify the nature of variables.

There are two important quantifiers.

I. Universal quantifier

II. Existential quantifier

Universal quantifier:
Some statements assert that a property is true for all values of a variable in a
particular domain, known as universe of discourse.

Definition:

A proposition P(x) is true for all the values of x in a universe of discourse is called the
universal quantification of P(x). It is denoted by ∀𝑥𝑃(𝑥) or (𝑥)𝑃(𝑥) .

The following phrases also represent the universal quantification:

for all

for every

for each
Course Instructor: Dr. A Kirupa 8
EXISTENTIAL QUANTIFIER
 Sometimes, there is another possibility that a proposition may not be

true for all the values in a particular universe of discourse.

 i.e) it may be true for one or some values.

Definition:

The proposition “there exists an element x in the universe of discourse

such that P(x) is true” is known as existential quantification of P(x). The

symbol ∃𝑥 represents the existential quantifier.

 For some x

 Some x such that

 There is at least one x such that


Course Instructor: Dr. A Kirupa 9
EXAMPLES
2
1. If 𝑃 𝑥 ≡ { −𝑥 = 𝑥 2 }, where the universe consists of all
2
integers, then the truth value of ∀𝑥{ −𝑥 = 𝑥 2 } is -------.

• Ans: True

2. Let 𝑃 𝑥 : 𝑥 2 < 10 and the universe of discourse be the set of


integers. Then the truth values of ∃𝑥𝑃 𝑥 & ∀𝑥𝑃 𝑥 .

• Ans: True and False

3. If 𝑄 𝑥 = 2𝑥 > 𝑥 , where the universe consists of all real numbers,


then the truth values of ∀𝑥 2𝑥 > 𝑥 is -------.

• Ans: False

Course Instructor: Dr. A Kirupa 10


4. If 𝑃(𝑥) ≡ 𝑥 is an integer & 𝑄(𝑥) ≡ 𝑥 is either positive or
negative.

• If 𝑃(𝑥) → 𝑄(𝑥) is a compound proposition function.

• What is the truth value for ∀𝑥{ 𝑃(𝑥) → 𝑄(𝑥)},

• Ans: T.
5. Let P(x, y): x is taller than y.
• If x is taller than y, then y is not taller than x.
• Write the symbolic form and also write for all x and y.
• ie) 𝑃 𝑥, 𝑦 → ¬𝑃 𝑦, 𝑥 .
• ∀𝑥∀𝑦{𝑃 𝑥, 𝑦 → ¬𝑃 𝑦, 𝑥 }.
Course Instructor: Dr. A Kirupa 11
Symbolize the statement
6. Every fruit is tasty.
For all x, If x is a fruit, then x is tasty.
F(x): x is a fruit.
T(x): x is tasty
The symbolic form is, ∀𝑥 𝐹 𝑥 → 𝑇 𝑥 .
7. Some men are clever.
There is an x such that, x is a man and x is clever.
M(x): x is a Man.
C(x): x is clever.
∃𝑥 𝑀 𝑥 ∧ 𝐶 𝑥 .

Course Instructor: Dr. A Kirupa 12


Symbolize the statement
8. Every dog is an animal.
For all x, If x is a dog, then x is an animal.
D(x): x is a dog.
A(x): x is an animal.
The symbolic form is, ∀𝑥 𝐷 𝑥 → 𝐴 𝑥 .
9. Some dog is a pet.
There is an x such that, x is a dog and x is pet.
D(x): x is a dog.
P(x): x is pet.
∃𝑥 𝐷 𝑥 ∧ 𝑃 𝑥 .

Course Instructor: Dr. A Kirupa 13


10. All cats have four legs.

11. Some dogs bark.

12. Some lions do not drink coffee.

13. Babies are innocent.

Course Instructor: Dr. A Kirupa 14


NEGATION OF A QUANTIFIED EXPRESSION

P(x): x has studied Computer Programming.


∀𝑥𝑃 𝑥 : Every student in this class has studied Computer
programming.
The negation of this statement:
There is a student in this class who has not studied
Computer programming.
The symbolic form is,
¬∀𝑥𝑃(𝑥) ≡ ∃𝑥¬𝑃(𝑥)

Course Instructor: Dr. A Kirupa 15


Similarly,
P(x): x has studied Computer Programming.
∃𝑥𝑃 𝑥 : There is a student in this class who has studied
Computer programming.
The negation of the statement is,
Every student in this class has not studied Computer
programming.
The symbolic form is,
¬∃𝑥𝑃 𝑥 ≡ ∀𝑥¬𝑃 𝑥

Course Instructor: Dr. A Kirupa 16


BOUND VARIABLE:

The variable is said to be bound if it is concerned with either

universal or existential quantifier.

SCOPE OF THE QUANTIFIER:

The scope of the quantifier is the formulae immediately following the

quantifier.

FREE VARIABLE:

The variable which is not concerned with any quantifier is called Free

Variable.

Course Instructor: Dr. A Kirupa 17


Examples

1. ∀𝑥𝑃 𝑥, 𝑦
x – Bound Variable
y – Free Variable
𝑃 𝑥, 𝑦 - Scope
2. ∃𝑥 𝑃 𝑥 ∨ 𝑄 𝑥
x – Bound
𝑃 𝑥 ∨ 𝑄 𝑥 - Scope

Course Instructor: Dr. A Kirupa 18


Course Instructor: Dr. A Kirupa 19

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