Scribd
Upload
17 views2 pages

Predicate Logic

Predicate Logic involves expressions called predicates that contain variables and can become propositions through assignment or quantification. It includes concepts like Well Formed Formulas (wffs), Universal and Existential Quantifiers, which express the truth of statements for all or some values of variables, respectively. Nested quantifiers allow for complex expressions involving multiple layers of quantification.

Uploaded by

VAISHNAVI KUMARI
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
17 views2 pages

Predicate Logic

Predicate Logic involves expressions called predicates that contain variables and can become propositions through assignment or quantification. It includes concepts like Well Formed Formulas (wffs), Universal and Existential Quantifiers, which express the truth of statements for all or some values of variables, respectively. Nested quantifiers allow for complex expressions involving multiple layers of quantification.

Uploaded by

VAISHNAVI KUMARI
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/ 2

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

 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∃bP(x,y) where P(a,b) denotes a+b=0

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

Note − ∀a∃bP(x,y) ≠ ∃a∀bP(x,y)

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