Scribd
Upload
14 views9 pages

Predicates and Quantifiers-1

The document explains predicates as functions or expressions that describe properties or relationships involving variables, with examples illustrating their use. It also defines the domain of predicates, which is the set of possible values for the variables, and discusses how the truth value of predicates can change based on the domain. Additionally, it introduces quantifiers, specifically universal and existential quantifiers, which express the extent to which a property holds true within a set.

Uploaded by

sidra.iman141
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
14 views9 pages

Predicates and Quantifiers-1

The document explains predicates as functions or expressions that describe properties or relationships involving variables, with examples illustrating their use. It also defines the domain of predicates, which is the set of possible values for the variables, and discusses how the truth value of predicates can change based on the domain. Additionally, it introduces quantifiers, specifically universal and existential quantifiers, which express the extent to which a property holds true within a set.

Uploaded by

sidra.iman141
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/ 9

Predicates And

Quantifiers
PRESENTED BY NIMRA TARIQ
Predicates
A predicate is a function or expression that describes a property of something or a relationship
between things.
For example, in the statement "isTall(x)," the predicate "isTall" describes whether "x" (a person)
is tall. If "x" is Ali, and Ali is tall, then "isTall(Ali)" is true.
Predicates use variables to represent objects. For example, "P(x)" can mean "x is a student."
If "x = Zoha," then "P(Zoha)" would mean “Zoha is a student."
Predicates can also describe relationships between multiple objects. For example, "Loves(x, y)"
means "x loves y."
If "x = Ali" and "y = Zoha," then "Loves(Ali, Zoha)" means “Ali loves Zoha."
Domain
The domain of a predicate refers to the set of all possible values that the variables in the
predicate can take.
For example, if we have a predicate "isEven(x)" where "x" is a number, the domain could be the
set of all integers (…,-3, -2, -1, 0, 1, 2, 3,…).
The truth value of a predicate depends on its domain. If we change the domain, the truth value
might change.
For instance, if "x" is within the domain of positive integers, the predicate "x > 0" is always true.
However, if the domain includes negative numbers, "x > 0" is not always true.
Example 1
•Predicate: "isStudent(x)" means "x is a student."
•Domain: The set of all people.
Example 2:

•Predicate: "LargerThan(x, y)" means "x is larger than y."


•Domain: The set of all integers (e.g., …, -2, -1, 0, 1, 2,…..)
Quantifier
Quantifiers are words or symbols in logic that tell us how many elements in a set or domain
satisfy a certain condition or property.
There are two main types of quantifiers:
1. Universal Quantifier ( ∀ )
2. Existential Quantifier ( ∃ )
Universal Quantifier ( ∀ )
This quantifier is used when we want to say that a statement is true for every element in a given
set or domain. The symbol for the universal quantifier is "∀," which stands for "for all."
For example, when we say "All humans are mortal," we are using a universal quantifier to
indicate that every human falls under the category of being mortal. This can be written in logical
form as ∀x (if x is a human, then x is mortal).
Existential quantifier
The existential quantifier is represented by phrases like "there exists," "for some," or "at least
one." This quantifier is used when we want to state that a statement is true for at least one
element in a given set or domain.
The symbol for the existential quantifier is "∃," which stands for "there exists." For instance,
when we say "There exists a number that is even," we use an existential quantifier to convey
that there is at least one number in the set that is even. This can be written in logical form as ∃x
(x is even).

You might also like