Scribd
Upload
110 views

Discrete Mathematics - Predicate Logic

Predicate logic deals with predicates, which are propositions containing variables. A predicate with variables can be made a proposition by either assigning a value to the variable or by quantifying the variable. There are two types of quantifiers in predicate logic: the universal quantifier and the existential quantifier. The universal quantifier states that statements within its scope are true for every value of a specific variable, while the existential quantifier states that statements are true for some values of a specific variable. Nested quantifiers use a quantifier that appears within the scope of another quantifier.

Uploaded by

Aldrich Panio
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
110 views

Discrete Mathematics - Predicate Logic

Predicate logic deals with predicates, which are propositions containing variables. A predicate with variables can be made a proposition by either assigning a value to the variable or by quantifying the variable. There are two types of quantifiers in predicate logic: the universal quantifier and the existential quantifier. The universal quantifier states that statements within its scope are true for every value of a specific variable, while the existential quantifier states that statements are true for some values of a specific variable. Nested quantifiers use a quantifier that appears within the scope of another quantifier.

Uploaded by

Aldrich Panio
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/ 3

8/31/22, 11:04 PM Discrete Mathematics - Predicate Logic

Discrete Mathematics - Predicate Logic

Discrete Math For Computer Science

20 Lectures 1.5 hours

 Lukáš Vyhnálek

More Detail

Predicate Logic deals with predicates, which are propositions containing variables.

Predicate Logic – Definition


A predicate is an expression of one or more variables defined on some specific domain. A predicate
with variables can be made a proposition by either assigning a value to the variable or by
quantifying the variable.

The following are some examples of predicates −

Let E(x, y) denote "x = y"


Let X(a, b, c) denote "a + b + c = 0"
Let M(x, y) denote "x is married to y"

Well Formed Formula


Well Formed Formula (wff) is a predicate holding any of the following −

All propositional constants and propositional variables are wffs

If x is a variable and Y is a wff, ∀xY and ∃xY are also wff

Truth value and false values are wffs


https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_predicate_logic.htm 1/3
8/31/22, 11:04 PM Discrete Mathematics - Predicate Logic

Each atomic formula is a wff

All connectives connecting wffs are wffs

Quantifiers
The variable of predicates is quantified by quantifiers. There are two types of quantifier in predicate
logic − Universal Quantifier and Existential Quantifier.

Universal Quantifier
Universal quantifier states that the statements within its scope are true for every value of the specific

variable. It is denoted by the symbol ∀ .

∀xP (x) is read as for every value of x, P(x) is true.

Example − "Man is mortal" can be transformed into the propositional form ∀xP (x) where P(x) is

the predicate which denotes x is mortal and the universe of discourse is all men.

Existential Quantifier
Existential quantifier states that the statements within its scope are true for some values of the
specific variable. It is denoted by the symbol ∃ .

∃xP (x) is read as for some values of x, P(x) is true.

Example − "Some people are dishonest" can be transformed into the propositional form ∃xP (x)

where P(x) is the predicate which denotes x is dishonest and the universe of discourse is some
people.

Nested Quantifiers
If we use a quantifier that appears within the scope of another quantifier, it is called nested
quantifier.

Example

∀ a ∃b P (x, y) where P (a, b) denotes a + b = 0

∀ a ∀ b ∀ c P (a, b, c) where P (a, b) denotes a + (b + c) = (a + b) + c

https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_predicate_logic.htm 2/3
8/31/22, 11:04 PM Discrete Mathematics - Predicate Logic

Note − ∀ a ∃b P (x, y) ≠ ∃a ∀b P (x, y)

https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_predicate_logic.htm 3/3

You might also like