Propositional Equivalences
Last Updated :
10 Apr, 2025
Propositional equivalences are fundamental concepts in logic that allow us to simplify and manipulate logical statements. Understanding these equivalences is crucial in computer science, engineering, and mathematics, as they are used to design circuits, optimize algorithms, and prove theorems. This article explores the main propositional equivalences, their applications, and examples.
Propositional equivalences are logical statements that are true for the same set of truth values. Two propositions P and Q are said to be logically equivalent if they have the same truth table. This is denoted as P≡Q.
Types of PropositionsNote: Propositional logic helps in simplifying and solving logical expressions.
Types of Propositions
Two types of propositions are defined below:
1. Atomic Propositions
- They are also called primitive propositions or basic statements.
- They are the simplest form of propositions and cannot be further divided into smaller meaningful statements.
- They represent a single fact or idea.
- Examples:
- "The sun is shining." (True)
- "It is raining today." (False)
- "2 + 2 = 4" (True)
2. Compound Propositions
- Created by combining atomic propositions using logical connectives.
- Logical connectives are symbols like "and", "or", "not", "implies", etc., that define the relationship between the atomic propositions.
- Examples:
- "The sun is shining and it is raining today." (Compound proposition using "and")
- "It is raining today or the sun is shining." (Compound proposition using "or")
- "It is not raining today." (Compound proposition using "not")
Key Propositional Equivalences
Some of the key propositional equivalences are given below:
1. Identity Laws
P∧true ≡ P
P∨false ≡ P
2. Domination Laws
P∨true ≡ true
P∧false ≡ false
3. Idempotent Laws
P∨P≡P
P∧P≡P
4. Double Negation Law
¬(¬P)≡P
5. Commutative Laws
P∨Q ≡ Q∨P
P∧Q ≡Q∧P
6. Associative Laws
(P∨Q)∨R ≡ P∨(Q∨R)
(P∧Q)∧R ≡ P∧(Q∧R)
7. Distributive Laws
P∨(Q∧R) ≡ (P∨Q)∧(P∨R)
P∧(Q∨R) ≡ (P∧Q)∨(P∧R)
8. De Morgan's Laws
¬(P∧Q) ≡ ¬P ∨¬Q
¬(P∨Q) ≡ ¬P ∧¬Q
9. Absorption Laws
P∨(P∧Q) ≡P
P∧(P∨Q) ≡P
10. Negation Laws
P∨¬P ≡true
P∧¬P ≡ false
Applications in Engineering
1. Digital Logic Design
In digital logic design, propositional equivalences are used to simplify Boolean expressions, which leads to more efficient circuit designs.
2. Software Engineering
In software engineering, propositional equivalences help optimize conditional statements in programming, making the code more efficient and readable.
3. Theoretical Computer Science
In theoretical computer science, propositional equivalences are used in the study of algorithms and computational complexity to prove the correctness and optimize the performance of algorithms.
4. Control Systems
In control systems engineering, propositional equivalences are used to simplify logical conditions in control algorithms, leading to more efficient and reliable system performance.
Solved Examples Propositional Equivalences
Example 1: Show that p ∧ (p ∨ q) ≡ p
Solution:
p ∧ (p ∨ q)
≡ (p ∧ p) ∨ (p ∧ q) (Distributive Law)
≡ p ∨ (p ∧ q) (Idempotent Law)
≡ p (Absorption Law)
Example 2: Prove that ¬(p ∧ q) ≡ ¬p ∨ ¬q (De Morgan's Law)
Solution:
¬(p ∧ q)
≡ ¬(¬(¬p ∨ ¬q)) (Double Negation Law)
≡ ¬p ∨ ¬q (De Morgan's Law)
Example 3: Show that p → q ≡ ¬p ∨ q
Solution:
p → q
≡ ¬p ∨ q (Definition of Implication)
Example 4: Prove that (p → q) ∧ (p → r) ≡ p → (q ∧ r)
Solution:
(p → q) ∧ (p → r)
≡ (¬p ∨ q) ∧ (¬p ∨ r) (Definition of Implication)
≡ ¬p ∨ (q ∧ r) (Distributive Law)
≡ p → (q ∧ r) (Definition of Implication)
Example 5: Show that ¬(p ↔ q) ≡ p ↔ ¬q
Solution:
¬(p ↔ q)
≡ ¬((p → q) ∧ (q → p)) (Definition of Biconditional)
≡ ¬(p → q) ∨ ¬(q → p) (De Morgan's Law)
≡ ¬(¬p ∨ q) ∨ ¬(¬q ∨ p) (Definition of Implication)
≡ (p ∧ ¬q) ∨ (q ∧ ¬p) (De Morgan's Law)
≡ (p ∧ ¬q) ∨ (¬p ∧ q) (Commutativity)
≡ p ↔ ¬q (Definition of Biconditional)
Example 5: Prove that p ∨ (¬p ∧ q) ≡ p ∨ q
Solution:
p ∨ (¬p ∧ q)
≡ (p ∨ ¬p) ∧ (p ∨ q) (Distributive Law)
≡ T ∧ (p ∨ q) (Law of Excluded Middle)
≡ p ∨ q (Identity Law)
Example 6: Show that (p → q) ∧ (q → r) → (p → r) is a tautology
Solution:
(p → q) ∧ (q → r) → (p → r)
≡ ¬((¬p ∨ q) ∧ (¬q ∨ r)) ∨ (¬p ∨ r) (Definition of Implication)
≡ (p ∧ ¬q) ∨ (q ∧ ¬r) ∨ ¬p ∨ r (De Morgan's Law and Distribution)
≡ (p ∧ ¬q) ∨ ¬p ∨ (q ∧ ¬r) ∨ r (Commutativity)
≡ ((p ∨ ¬p) ∧ (¬q ∨ ¬p)) ∨ ((q ∨ r) ∧ (¬r ∨ r)) (Distributive Law)
≡ (T ∧ (¬q ∨ ¬p)) ∨ ((q ∨ r) ∧ T) (Law of Excluded Middle)
≡ (¬q ∨ ¬p) ∨ (q ∨ r) (Identity Law)
≡ T (Always true, thus a tautology)
Example 7: Prove that ¬(p ∨ q) ≡ ¬p ∧ ¬q (De Morgan's Law)
Solution:
¬(p ∨ q)
≡ ¬¬(¬p ∧ ¬q) (Double Negation Law)
≡ ¬p ∧ ¬q (Double Negation Law)
Example 8: Show that (p ∧ q) → r ≡ p → (q → r)
Solution:
(p ∧ q) → r
≡ ¬(p ∧ q) ∨ r (Definition of Implication)
≡ (¬p ∨ ¬q) ∨ r (De Morgan's Law)
≡ ¬p ∨ (¬q ∨ r) (Associative Law)
≡ ¬p ∨ (q → r) (Definition of Implication)
≡ p → (q → r) (Definition of Implication)
Example 9: Prove that (p ↔ q) ≡ (p → q) ∧ (q → p)
Solution:
p ↔ q
≡ (p → q) ∧ (q → p) (Definition of Biconditional)
≡ (¬p ∨ q) ∧ (¬q ∨ p) (Definition of Implication)
≡ (¬p ∨ q) ∧ (p ∨ ¬q) (Commutativity)
≡ (p → q) ∧ (q → p) (Definition of Implication)
Practice Problems on Propositional Equivalences
Question 1. Prove that p → (q → r) ≡ (p ∧ q) → r.
Question 2. Show that (p → q) ∨ (p → r) ≡ p → (q ∨ r).
Question 3. Demonstrate that ¬(p → q) ≡ p ∧ ¬q.
Question 4. Prove that (p → q) ∧ (p → ¬q) ≡ ¬p.
Question 5. Show that (p ∨ q) ∧ (p ∨ r) ≡ p ∨ (q ∧ r).
Question 6. Prove that (p → q) ∧ (r → s) ≡ (p ∧ r) → (q ∧ s).
Question 7. Demonstrate that p ↔ q ≡ (p ∧ q) ∨ (¬p ∧ ¬q).
Question 8. Show that ¬(p ↔ q) ≡ p ↔ ¬q.
Question 9. Prove that (p → q) → r ≡ (¬p → r) ∧ (q → r).
Question 10. Demonstrate that (p ∨ q) → r ≡ (p → r) ∧ (q → r).
Conclusion
- These practice problems cover a variety of propositional equivalences, focusing on key logical operations and laws.
- They include tasks involving implications, conjunctions, disjunctions, negations, and biconditionals.
- The problems require applying fundamental principles such as De Morgan's laws, distributive laws, and the definitions of implication and biconditional.
- Working through these exercises will help strengthen understanding of logical equivalences, improve skills in manipulating logical expressions, and enhance the ability to prove logical relationships.
- These problems are designed to challenge logical thinking and provide practice in transforming complex logical statements into equivalent forms, which is a crucial skill in fields such as mathematics, computer science, and formal logic.
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