Propositional Equivalences

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.

Note: 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

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)) (Biconditional)
≡ ¬(p → q) ∨ ¬(q → p) (De Morgan)
≡ ¬(¬p ∨ q) ∨ ¬(¬q ∨ p) (Implication)
≡ (p ∧ ¬q) ∨ (¬p ∧ q) (De Morgan)
≡ p ⊕ q (XOR)
≡ p ↔ ¬q (Equivalence)

Example 6: 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 7: Show 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 8: Prove that ¬(p ∨ q) ≡ ¬p ∧ ¬q (De Morgan's Law)
Solution:

¬(p ∨ q)
≡ ¬¬(¬p ∧ ¬q) (Double Negation Law)
≡ ¬p ∧ ¬q (Double Negation Law)

Example 9: 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 10: 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

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 ∧ r) → (q ∧ s) ≡ (p → q) ∨ (r → 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).