2.3.1. Identity and Double Negation Laws

Today, we're discussing logical equivalence. Can anyone tell me what they think it means?

Does it mean that two statements can be true at the same time?

That's a good start! Logical equivalence means that two propositions always have the same truth value; if one is true, the other must be true as well. It's like a relationship—if you have one condition, the other follows.

Can you give us an example?

Sure! Consider p → q and ¬q → ¬p. These are logically equivalent; both expressions convey the same truth regardless of the truth values assigned to p and q.

How do we prove they are equivalent?

Great question! We can use truth tables or standard logical identities which we will explore later. Remember, logical equivalence is often denoted as X ≡ Y.

To remember this, think of the acronym 'EQUAL' – Equivalence = Quality of truth values.

Let's summarize. Logical equivalence means two statements always share the same truth value; we can prove this using truth tables or identities.

Now, let’s discuss three key terms: tautology, contradiction, and contingency. Who can define a tautology?

I think a tautology is something that is always true?

Exactly! For example, the statement p ∨ ¬p is always true, no matter the truth value of p. It's a tautology because it includes both p and its negation.

What about contradiction?

A contradiction, on the other hand, is always false. For instance, p ∧ ¬p is a contradiction since it can never be true regardless of the circumstances. You cannot have a statement and its negation true at the same time.

And what is a contingency?

A contingency is a statement that can be either true or false. For example, p ∧ q is contingent because its truth depends on the truth values of p and q. If both are true, then it’s true; otherwise, it’s false.

To memorize this, think of 'TAC'—Tautology Always True, Contradiction Always False, Contingency can be both.

In summary, a tautology is always true, a contradiction is always false, and a contingency depends on the situation.

Next, let's explore the Identity Laws. Can anyone tell me what they are?

I remember something about true and false...?

Correct! The identity law states that p ∧ true = p and p ∨ false = p. This means that whenever you conjoin with true, the statement remains unchanged.

What else is part of the identity laws?

We also have the Double Negation Law, which tells us that ¬(¬p) = p. Negating a negation brings you back to the original proposition.

So, if I have a statement 'not not p', I just get 'p'?

Exactly! Think of it as unwrapping a gift. The double negation just takes off the extra layer, leaving you with the original proposition.

To help remember this, use 'DINE' for Double Negation Equals the original statement.

To conclude, Identity Laws define how conjunctions or disjunctions with true or false affect propositions, while Double Negation Law clarifies that two negatives create a positive.

Our final topic today involves verifying logical identities using truth tables. Can someone remind me what a truth table is?

A table that shows all possible truth values for a given statement, right?

Exactly! And for identities like De Morgan’s laws, we construct truth tables for both sides and check if they match.

Can you show us an example?

Absolutely! Let's take the De Morgan’s law: ¬(p ∧ q) = ¬p ∨ ¬q. We’ll build a table for both sides. If they match, the identity holds.

How do we know if it’s too complicated for a truth table?

Good point! Truth tables are feasible for up to three variables. Beyond that, it becomes too complex. In such cases, we rely on known logical identities.

Summarizing today’s discussion, we explored how to establish logical identities using truth tables and their limitations, as well as the importance of knowing logical laws.