4.1 Defining Logical Equivalence

Logical equivalence captures when two statements always share the same truth value, no matter what. Understanding this concept lets you swap one statement for another in proofs and arguments, confident that nothing changes logically. This section covers how equivalence is defined, how to test for it with truth tables, and how it connects to necessary and sufficient conditions.

Logical Equivalence and Tautology

Defining Logical Equivalence and Tautology

Two statements are logically equivalent when they have the same truth value in every possible case. No matter how you assign truth values to the component variables, both statements come out the same. Logical equivalence is denoted with the symbol $\equiv$.

For example, $p \land q \equiv q \land p$. This is the commutativity of conjunction: "and" doesn't care about order. If you build truth tables for both sides, every row will match.

A tautology is a statement that is true in every possible case, regardless of what its components do. The classic example is the law of excluded middle: $p \lor \neg p$. Whether $p$ is true or false, the disjunction comes out true.

These two ideas connect in an important way:

• If two statements are logically equivalent, their biconditional is a tautology. That is, if $A \equiv B$, then $A \leftrightarrow B$ is true in every row of the truth table.
• Any tautology is logically equivalent to any other tautology, since they're all true in every case.

This first point gives you a concrete test: to check whether $A \equiv B$, you can build the truth table for $A \leftrightarrow B$ and see if it's a tautology.

Using Truth Tables to Determine Logical Equivalence

Truth tables are the most straightforward way to verify logical equivalence. Here's the process:

1. List all possible truth value assignments for the atomic variables involved. With $n$ variables, you'll have $2^n$ rows.
2. Construct the truth table for each statement, evaluating the final column for both.
3. Compare the final columns row by row. If they match in every single row, the statements are logically equivalent. If even one row differs, they are not.

For example, to test whether $\neg(p \land q) \equiv \neg p \lor \neg q$ (De Morgan's Law), you'd build a four-row table (two variables), compute both sides, and confirm all four rows agree.

Biconditional and Logical Equivalence

The biconditional ($\leftrightarrow$) is the connective that expresses "if and only if." $p \leftrightarrow q$ is true when $p$ and $q$ have the same truth value (both true or both false), and false when they differ.

You can define the biconditional using other connectives:

$p \leftrightarrow q \equiv (p \rightarrow q) \land (q \rightarrow p)$

This makes intuitive sense: "if and only if" means the conditional goes both directions.

Be careful to distinguish the biconditional ($\leftrightarrow$) from logical equivalence ($\equiv$). The biconditional is a connective inside the logical language that forms a new compound statement. Logical equivalence is a metalogical claim about two statements always sharing truth values. They're closely related, but they operate at different levels: $A \equiv B$ holds exactly when $A \leftrightarrow B$ is a tautology.

Logical equivalence is also a symmetric relation: if $p \equiv q$, then $q \equiv p$. This follows directly from the symmetry of "same truth value."

Necessary and Sufficient Conditions

Defining Necessary and Sufficient Conditions

A necessary condition is one that must hold for a statement to be true. If $p$ is a necessary condition for $q$, then whenever $q$ is true, $p$ must also be true. In formal terms: $q \rightarrow p$.

• Being a mammal is a necessary condition for being a dog. Every dog is a mammal, so if something is a dog, it must be a mammal.

A sufficient condition is one that guarantees the truth of a statement. If $p$ is a sufficient condition for $q$, then whenever $p$ is true, $q$ is automatically true. In formal terms: $p \rightarrow q$.

• Being a dog is a sufficient condition for being a mammal. Knowing something is a dog is enough to conclude it's a mammal.

Notice the direction of the arrow flips. This is a common source of confusion: the necessary condition sits on the consequent side of the conditional, while the sufficient condition sits on the antecedent side.

Interchangeability of Necessary and Sufficient Conditions

Necessary and sufficient conditions are interchangeable through contraposition. Recall that a conditional and its contrapositive are logically equivalent: $p \rightarrow q \equiv \neg q \rightarrow \neg p$.

This gives you two useful translations:

• If $p$ is a necessary condition for $q$ (i.e., $q \rightarrow p$), then $\neg p$ is a sufficient condition for $\neg q$. Example: if being a mammal is necessary for being a dog, then not being a mammal is sufficient for not being a dog.
• If $p$ is a sufficient condition for $q$ (i.e., $p \rightarrow q$), then $\neg q$ is a necessary condition for $\neg p$. Example: if being a dog is sufficient for being a mammal, then not being a mammal is necessary for not being a dog.

Logical Equivalence and Necessary and Sufficient Conditions

When $p$ is both a necessary and sufficient condition for $q$, the two statements are logically equivalent. You have both $p \rightarrow q$ and $q \rightarrow p$, which together give you $p \leftrightarrow q$, and that biconditional is a tautology.

For example, being a triangle is both necessary and sufficient for being a three-sided polygon. You can't have one without the other, so "is a triangle" $\equiv$ "is a three-sided polygon."