Predicates and Quantifiers Rules
Last Updated : 12 Aug, 2025
Before diving into Predicates and Quantifiers Rules, you need to know about predicates and quantifiers, and propositional logic rules.
Logical Equivalences involving Quantifiers
Two logical statements involving predicates and quantifiers are considered equivalent if and only if they have the same truth value, no matter which predicates are substituted into these statements, irrespective of the domain used for the variables in the propositions.
There are two very important equivalences involving quantifiers :
- ∀x (P(x) ∧ Q(x)) ≡∀x P(x) ∧ ∀x Q(x)
- ∃x (P(x) ∨ Q(x)) ≡ ∃x P(x) ∨ ∃x Q(x)
The question arises whether the equivalences would hold if the conjunction is replaced with disjunction in (1) and disjunction is replaced with the conjunction in (2).
The answer may seem like Yes, but on second thought, you would realize that the answer is No. To prove why they are not equivalent, we must understand what makes two statements equivalent, as explained in Propositional Equivalences.
If after interchanging, they are equivalent, then,
∀x (P(x) ∨ Q(x)) ⇔ ∀x P(x) ∨ ∀x Q(x)
and
∃x (P(x) ∧ Q(x)) ⇔ ∃x P(x) ∧ ∃x Q(x)
Both must be true.
Let us first check for ∀x (P(x) ∨ Q(x)) ⇔ ∀x P(x) ∨ ∀x Q(x). Is ∀x ((P(x) ∨ Q(x)) ⇒∀x P(x) ∨ ∀x Q(x) is true?
The answer is No.
Proof:
- Suppose the hypothesis ∀x (P(x) ∨ Q(x)) is true.
- This means there are certain x values for which P(x) is true and others where Q(x) is true.
- It is also possible that for some x values, both P(x) and Q(x) are true.
- But in any case, all x values must either satisfy P(x), Q(x), or both, since the hypothesis is true.
- The conclusion (right-hand side) is true when the disjunction (P(x) ∨ Q(x)) is true.
From the reasoning above, we can see that P(x) is true for some values of x, and Q(x) is true for others. Thus, both "∀x P(x)" and "∀x Q(x)" are false, since neither of them is true for all values of x.
If P(x) and Q(x) are true for all x, then this equivalence would be true. However, in all other cases, it is false. Therefore,
∀x P(x) ∨ ∀x Q(x) ≡ F
According to our assumption, the hypothesis is true, but our conclusion turned out to be false. This cannot be true for a conditional, therefore the conditional
∀x (P(x) ∨ Q(x)) ⇒ ∀x P(x) ∨ ∀x Q(x) is false.
Since one conditional is false, the complete biconditional is false.
Hence, ∀x(P(x) ∨ Q(x)) \not\equiv ∀xP(x) ∨ ∀xQ(x)
In a similar way, it can also be proved that,
∃x(P(x) ∧ Q(x)) \not\equiv ∃xP(x) ∧ ∃xQ(x)
As an exercise, prove the above non-equivalence and also the equivalences involving quantifiers stated above. Remember to prove the bi-conditional and not just one conditional.
Negation of Quantifiers
Rules of Negations
When we negate statements with quantifiers, the type of quantifier is reversed. A negated universal quantifier turns into an existential quantifier, and a negated existential quantifier turns into a universal quantifier.
¬∀x P(x) ≡ ∃x ¬P(x)
- "It is not true that for all x, P(x) is true" is same as "There exists an x such that P(x) is false."
Similarly:
¬∃x P(x) ≡∀x ¬P(x)
- "There does not exist an x such that P(x) is true" is same as "For all x, P(x) is false."
Example of Negating Universal Quantifier
Consider the statement : ∀x P(x) as
"Every Computer Science Graduate has taken a course in Discrete Mathematics."
The above statement is a universal quantification. Here, P(x) is the statement "x has taken a course in Discrete Mathematics" and the domain of x is all Computer Science Graduates.
The negation of this statement is ¬∀x P(x) and can be expressed using an existential quantification as ∃x ¬P(x) :
"It is not the case that every computer science graduate has taken a course in Discrete Mathematics"
or
"There is a computer science graduate who has not taken a course in Discrete Mathematics".
Nested Quantifiers
It is possible to use two quantifiers such that one quantifier is within the scope of the other one. In such cases the quantifiers are said to be nested. For example,
∀x ∃y (x + y = 0)
The above statement is interpreted as
"For all x, there exists a y such that x + y = 0"
Note: The relative order in which the quantifiers are placed is important unless all the quantifiers are of the same kind i.e. all are universal quantifiers or all are existential quantifiers.
Also Check
GATE CS Corner Questions
Majority of the questions asked in GATE from Discrete Mathematics focus on Predicate Logic. Almost all of them involve quantifiers. Practicing the following questions will help you test your knowledge. All questions have been asked in GATE in previous years or in GATE Mock Tests.
Similar Reads
Engineering Mathematics Tutorials Engineering mathematics is a vital component of the engineering discipline, offering the analytical tools and techniques necessary for solving complex problems across various fields. Whether you're designing a bridge, optimizing a manufacturing process, or developing algorithms for computer systems,
3 min read
Linear Algebra
MatricesMatrices are key concepts in mathematics, widely used in solving equations and problems in fields like physics and computer science. A matrix is simply a grid of numbers, and a determinant is a value calculated from a square matrix.Example: \begin{bmatrix} 6 & 9 \\ 5 & -4 \\ \end{bmatrix}_{2
3 min read
Row Echelon FormRow Echelon Form (REF) of a matrix simplifies solving systems of linear equations, understanding linear transformations, and working with matrix equations. A matrix is in Row Echelon form if it has the following properties:Zero Rows at the Bottom: If there are any rows that are completely filled wit
4 min read
Eigenvalues and EigenvectorsEigenvalues and eigenvectors are fundamental concepts in linear algebra, used in various applications such as matrix diagonalization, stability analysis and data analysis (e.g., PCA). They are associated with a square matrix and provide insights into its properties.Eigen value and Eigen vectorTable
10 min read
System of Linear EquationsA system of linear equations is a set of two or more linear equations involving the same variables. Each equation represents a straight line or a plane and the solution to the system is the set of values for the variables that satisfy all equations simultaneously.Here is simple example of system of
5 min read
Matrix DiagonalizationMatrix diagonalization is the process of reducing a square matrix into its diagonal form using a similarity transformation. This process is useful because diagonal matrices are easier to work with, especially when raising them to integer powers.Not all matrices are diagonalizable. A matrix is diagon
8 min read
LU DecompositionLU decomposition or factorization of a matrix is the factorization of a given square matrix into two triangular matrices, one upper triangular matrix and one lower triangular matrix, such that the product of these two matrices gives the original matrix. It is a fundamental technique in linear algebr
6 min read
Finding Inverse of a Square Matrix using Cayley Hamilton Theorem in MATLABMatrix is the set of numbers arranged in rows & columns in order to form a Rectangular array. Here, those numbers are called the entries or elements of that matrix. A Rectangular array of (m*n) numbers in the form of 'm' horizontal lines (rows) & 'n' vertical lines (called columns), is calle
4 min read
Sequence & Series
Calculus
Limits, Continuity and DifferentiabilityLimits, Continuity, and Differentiation are fundamental concepts in calculus. They are essential for analyzing and understanding function behavior and are crucial for solving real-world problems in physics, engineering, and economics.Table of ContentLimitsKey Characteristics of LimitsExample of Limi
10 min read
Cauchy's Mean Value TheoremCauchy's Mean Value theorem provides a relation between the change of two functions over a fixed interval with their derivative. It is a special case of Lagrange Mean Value Theorem. Cauchy's Mean Value theorem is also called the Extended Mean Value Theorem or the Second Mean Value Theorem.According
7 min read
Taylor SeriesA Taylor series represents a function as an infinite sum of terms, calculated from the values of its derivatives at a single point.Taylor series is a powerful mathematical tool used to approximate complex functions with an infinite sum of terms derived from the function's derivatives at a single poi
8 min read
Inverse functions and composition of functionsInverse Functions - In mathematics a function, a, is said to be an inverse of another, b, if given the output of b a returns the input value given to b. Additionally, this must hold true for every element in the domain co-domain(range) of b. In other words, assuming x and y are constants, if b(x) =
3 min read
Definite Integral | Definition, Formula & How to CalculateA definite integral is an integral that calculates a fixed value for the area under a curve between two specified limits. The resulting value represents the sum of all infinitesimal quantities within these boundaries. i.e. if we integrate any function within a fixed interval it is called a Definite
8 min read
Application of Derivative - Maxima and MinimaDerivatives have many applications, like finding rate of change, approximation, maxima/minima and tangent. In this section, we focus on their use in finding maxima and minima.Note: If f(x) is a continuous function, then for every continuous function on a closed interval has a maximum and a minimum v
6 min read
Probability & Statistics
Mean, Variance and Standard DeviationMean, Variance and Standard Deviation are fundamental concepts in statistics and engineering mathematics, essential for analyzing and interpreting data. These measures provide insights into data's central tendency, dispersion, and spread, which are crucial for making informed decisions in various en
10 min read
Conditional ProbabilityConditional probability defines the probability of an event occurring based on a given condition or prior knowledge of another event. It is the likelihood of an event occurring, given that another event has already occurred. In probability, this is denoted as A given B, expressed as P(A | B), indica
12 min read
Bayes' TheoremBayes' Theorem is a mathematical formula used to determine the conditional probability of an event based on prior knowledge and new evidence. It adjusts probabilities when new information comes in and helps make better decisions in uncertain situations.Bayes' Theorem helps us update probabilities ba
13 min read
Probability Distribution - Function, Formula, TableA probability distribution is a mathematical function or rule that describes how the probabilities of different outcomes are assigned to the possible values of a random variable. It provides a way of modeling the likelihood of each outcome in a random experiment.While a Frequency Distribution shows
13 min read
Covariance and CorrelationCovariance and correlation are the two key concepts in Statistics that help us analyze the relationship between two variables. Covariance measures how two variables change together, indicating whether they move in the same or opposite directions. Relationship between Independent and dependent variab
6 min read
Practice Questions