2.4. Verification of Logical Identities

There are various standard logical equivalent statements which are available which are very commonly used in mathematical logic and they are also called by various names. So for instance, the conjunction of p and true is always p that is called this law is called as the identity law. In the same way we have this double negation law which says that if you take the negation of negation of p then that is logically equivalent to p. We have this De Morgan’s law which is very important which says that if you have a negation outside then you can take the negation inside and split it across the various variables and if you have conjunction inside then it becomes disjunction and vice versa. We also have this distributive law this says that you can distribute the disjunction over conjunction and so on.

This chunk introduces various standard logical identities, naming a few key ones. Each logical identity offers a fundamental principle in logic. The identity law states that combining a statement with 'true' will yield that statement (e.g., p ∧ true = p). The double negation law reveals that negating a negation restores the original statement (¬(¬p) = p). De Morgan’s laws provide critical rules for translating between conjunctions and disjunctions when negations are involved, and the distributive law illustrates how conjunctions can be distributed over disjunctions.

Think of logical identities as shortcuts in math like simplifying an expression. For instance, if you have 3 + 2, knowing that this simplifies directly to 5 is akin to knowing that p ∧ true simplifies to just p. The double negation law can be compared to saying, 'I’m not not going to the party,' which effectively means, 'I am going to the party.'

How do we verify whether these logical identities are correct? Well, we can verify using the truth table method namely we can draw, we can construct a truth table of the left hand side of the expression, we draw the truth table of the right hand side of the expression and verify whether the truth tables are the same. So for instance, if you want to verify the De Morgan’s law, so the first part of the De Morgan’s law says that the negation of conjunction of p and q is logically equivalent to negation p disjunction negation q. So what you can do is you can draw the truth table for the left hand side here. You can draw the truth table for the right hand side part here. And you can easily verify that the rows of both the tables are equivalent, they are same and that is why I can say that these two are logical equivalent statement.

This chunk discusses the method of verification for logical identities using truth tables. The process involves constructing two truth tables: one for the left-hand side (LHS) of an expression and one for the right-hand side (RHS). By comparing both tables, students can confirm if the truth values align, proving the equivalence of the expressions. For instance, in verifying De Morgan's law, students would check if the negation of the conjunction (¬(p ∧ q)) has the same truth values as the disjunction of the negations (¬p ∨ ¬q).

Imagine a two-way street where two cars must pass each other. Each car represents a statement, and the truth values are their paths. The truth table acts as a map showing all possible outcomes for both cars. If both cars can indeed pass when going in either direction, you know they are compatible (logically equivalent).

However, the truth table method of verifying logically equivalent statement has a limitation. Namely, the limitation here is it works as long as the number of variables the number of propositional variables which are there in your identity or the statement this is small. So in all this logical identity that I have written down in this table, there are at most three propositional variables and if I try to draw the truth table of a statement having 3 variables, and there will be only 8 rows which are easy to manage. But imagine I have a logical identity which has a 20 number of variables then the number of rows and that truth table will be 220 and definitely you cannot draw such a huge table.

Here, the text explains the limitations of using truth tables for verifying logical identities. As the number of propositional variables increases, the complexity of the truth table grows exponentially. For every new variable, the number of rows doubles (2^n for n variables). For instance, while 3 variables yield 8 rows (2^3), a situation with 20 variables results in 1,048,576 rows (2^20), making manual construction unfeasible.

Think of trying to organize a huge party with many guests. If you had a small party, keeping track of the attendance and preferences would be manageable. But if the guest list grows into the thousands, it becomes overwhelming! Just like organizing the party, constructing a truth table for extensive logical expressions quickly becomes impractical.

So that is why what we do here is we use some standard logical equivalent statements. For instance, these are some of the standard logical equivalent statements, which we use to simplify complex expressions and verify whether those complex expressions are logically equivalent or not and this is something similar to what we do in our regular maths. In regular maths if we have two expressions and if you want to simplify one expression and convert it to another expression then we have some well-known rules which we can always use to do some substitution in our process of simplifying the expressions.

This chunk emphasizes the practice of utilizing established logical identities to simplify complex logical expressions instead of using truth tables. By applying these identities, mathematicians can transform a complicated logical statement into a simpler one while maintaining its logical equivalence. This practice mirrors methods in traditional mathematics where established rules help streamline calculations and proofs.

Consider a recipe for a cake. If you find a shortcut to mix the ingredients more effectively, you can save time without changing the final product’s taste. Likewise, using logical identities helps streamline logical expressions without altering their truth values.

Now let us do an example here. Suppose I want to prove that my LHS expression and RHS expression, they are logically equivalent so this is my statement X this is my statement Y. Well in this case I can use the truth table method because my expressions X and Y involve only 2 variables and I can draw truth table which will have only 4 rows, but what I want to do here, I want to demonstrate here is that without even drawing the truth table, I can show that the expressionX is logically equivalent to expression Y by using logical identities.

This chunk presents an example to demonstrate logical equivalence, illustrating how to show that two expressions (X and Y) are equivalent without a truth table. By applying logical identities, one can validate the equivalence step by step. The example aims to enhance understanding by connecting theoretical concepts with practical application, illustrating how transforming statements using known laws leads to the conclusion of equivalence.

If you're trying to determine if two different models of cars can serve the same purpose—for instance, both being able to drive at high speeds—rather than testing them during a race, you might use specifications like horsepower, weight, and aerodynamics. If both satisfy the necessary criteria effectively, they are equivalent in their performance. Similarly, logical identities allow you to ascertain the equivalence of statements without exhaustive checks.

--