Scribd
Upload
210 views14 pages

Predicate Logic PDF

Predicate logic extends propositional logic by adding predicates and quantifiers. Predicates refer to properties that variables in statements can have. Quantifiers are used to express whether a predicate is true for all or some variables over a domain. There are two types of quantification: universal quantification using ∀ asserts a predicate is true for all variables, while existential quantification using ∃ asserts a predicate is true for at least one variable. Quantification allows representing statements about variables and their properties more precisely.

Uploaded by

Nath Bongalon
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
210 views14 pages

Predicate Logic PDF

Predicate logic extends propositional logic by adding predicates and quantifiers. Predicates refer to properties that variables in statements can have. Quantifiers are used to express whether a predicate is true for all or some variables over a domain. There are two types of quantification: universal quantification using ∀ asserts a predicate is true for all variables, while existential quantification using ∃ asserts a predicate is true for at least one variable. Quantification allows representing statements about variables and their properties more precisely.

Uploaded by

Nath Bongalon
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/ 14

LOGIC

Predicate logic is an extension of Propositional


logic.

It adds the concept of predicates and quantifiers


to better capture the meaning of statements
that cannot be adequately expressed by
propositional logic.
Consider the statement, “x is greater than 3″.

It has two parts.

The first part, the variable x, is the subject of the


statement.

The second part, “is greater than 3”, is the


predicate.

It refers to a property that the subject of the


statement can have.
In general, a statement involving n variables x1, x2, x3,.. , xn
can be denoted by P(x1, x2, x3,.. , xn).

Here P is also referred to as n-place predicate or a n-ary


predicate.
Let P(x) denote the statement “x > 10″.
What are the truth values of P(11) and P(5)?

Solution:

P(11) is equivalent to the statement 11 > 10,


which is True.

P(5) is equivalent to the statement 5 > 10, which


is False.
Let R(x,y) denote the statement “x = y + 1“.

What is the truth value of the propositions


R(1,3) and R(2,1)?

Solution:

R(1,3) is the statement 1 = 3 + 1, which is False.

R(2,1) is the statement 2 = 1 + 1, which is True.


In predicate logic, predicates are used alongside
quantifiers to express the extent to which a
predicate is true over a range of elements.

Using quantifiers to create such propositions is


called quantification.

There are two types of quantification-


Mathematical statements sometimes assert that
a property is true for all the values of a variable
in a particular domain, called the domain of
discourse.

Such a statement is expressed using universal


quantification.
The universal quantification of P(x) for a particular
domain is the proposition that asserts that P(x) is true for
all values of x in this domain.

The domain is very important here since it decides the


possible values of x.

The meaning of the universal quantification of P(x)


changes when the domain is changed.

The domain must be specified when a universal


quantification is used, as without it, it has no meaning.
Formally,

The universal quantification of P(x) is the statement


"P(x) for all values of x in the domain"

The notation ∀P(x) denotes the universal quantification of


P(x).

Here ∀ is called the universal quantifier.

∀P(x) is read as "for all x P(x)".


Example: Let P(x) be the statement “x + 2 > x“.

What is the truth value of the statement ∀xP(x)?

Solution:

As x+2 is greater than x for any real number,


so P(x) ≡ T for all x or ∀xP(x) ≡ T.
Some mathematical statements assert that there
is an element with a certain property.

Such statements are expressed by existential


quantification.

Existential quantification can be used to form a


proposition that is true if and only if P(x) is true
for at least one value of x in the domain.
Formally,

The existential quantification of P(x) is the statement


"There exists an element x in the domain such that P(x)"

The notation ∃P(x) denotes the existential quantification of


P(x).

Here ∃ is called the existential quantifier.

∃P(x) is read as "There is atleast one such x such that P(x)".


Example : Let P(x) be the statement “x > 5″.

What is the truth value of the statement ∃xP(x) ?

Solution:

P(x) is true for all real numbers greater than 5 and false
for all real numbers less than 5. So ∃xP(x) ≡ T.

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