Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

Logical Equivalences







Introduction to Logical Equivalences

Logical equivalences are fundamental building blocks in propositional logic that help us understand when two different-looking statements actually mean the same thing. Two logical statements are logically equivalent if they always produce identical truth values, regardless of the truth values of their components.

Understanding logical equivalences is crucial for simplifying complex logical expressions, constructing proofs, and analyzing logical arguments. This comprehensive guide explores multiple verification methods, from truth tables for small expressions to algebraic manipulation using established logical laws.

We'll cover essential equivalences including material implication (transforming "if-then" statements), De Morgan's laws (handling negations of compound statements), and biconditional equivalences (understanding "if and only if" relationships). You'll also learn fundamental laws like the distributive, associative, and absorption laws that form the foundation of logical reasoning.

Whether you're working with simple propositions or complex nested statements, mastering these equivalences will give you powerful tools for logical analysis, proof construction, and mathematical reasoning. Each equivalence comes with clear explanations and practical applications to help you understand not just what these relationships are, but why they work.


Definition

Two formulas can look different and still say the same thing.
"If it rains, the ground is wet" and "it does not rain, or the ground is wet" are worded differently, yet it is hard to imagine a situation where one is true and the other false. Logic can check that suspicion exactly.
P → Q and ¬P ∨ Q have the same column in every row of their truth table.
List all four assignments of PP and QQ and evaluate both formulas. The two highlighted columns match row for row.
PQP → Q¬P¬P ∨ Q
TTTFT
TFFFF
FTTTT
FFTTT
AB
With circle A for the cases where PP is true and B for QQ, the shaded region is Ac∪BA^c \cup B — the cases where ¬P∨Q\neg P \lor Q holds, which are exactly the cases where P→QP \to Q holds. The same state is on the Venn truth-table explorer.
Matching in every row means no situation can tell them apart — and a single mismatch would.
Because the rows cover every possible case, two formulas with identical columns can replace each other anywhere without changing any truth value. Like two routes to the same address, it does not matter which one is taken. Compare P→QP \to Q with its converse Q→PQ \to P: they agree in two rows and disagree in two, so they are not interchangeable.
PQP → QQ → Pagree?
TTTTyes
TFFTno
FTTFno
FFTTyes
The definition
Two formulas are logically equivalent, written P≡QP \equiv Q, when they have the same truth value under every assignment of truth values to their variables.
Two logical statements (or propositions) are logically equivalent if they always have the same truth value, regardless of the truth values of their individual components. This means that no matter what, both expressions will evaluate to either true or false together in every possible case.
So P→Q≡¬P∨QP \to Q \equiv \neg P \lor Q, while P→QP \to Q and Q→PQ \to P are not equivalent.
Equivalence is a relation between two formulas — a claim about them, not a formula itself.
P≡QP \equiv Q says something about PP and QQ across all cases at once; it is simply true or false. The biconditional P↔QP \leftrightarrow Q is different: it is a formula whose truth changes from row to row. The two are linked — P≡QP \equiv Q holds exactly when P↔QP \leftrightarrow Q is a tautology — and the notation section keeps them apart.
It takes every row: agreement in most rows is not enough.
P→QP \to Q and Q→PQ \to P agree half the time, and that is exactly why they are easy to confuse. To claim an equivalence, all 2n2^n rows must match; to refute one, a single row is enough. The section on how to verify logical equivalence gives the methods.
The rest of the page covers the notation, ways to verify an equivalence, the laws of logic, and equivalences involving the conditional and the biconditional.

Equivalence Notation

Notation

Equivalence Notation

Three legitimate spellings for one meta-claim — and a lookalike connective that is not one of them. The ≡-versus-↔ boundary is the working distinction of this whole page.
The letters PP, QQ and the connectives inside every law come from propositional logic notation; the biconditional ↔\leftrightarrow itself is one of those five connectives.
P≡QP \equiv Q
P is logically equivalent to Q
The triple bar makes a claim about formulas: PP and QQ agree in every possible case. It is a statement in the metalanguage — always simply true or false — produced in LaTeX by \equiv.
CasesLaws are equivalences promoted to principles — every row of the laws table is an ≡\equiv claim; How to Verify Logical Equivalence? below gives the checking methods.
Do not confuseThe biconditional. P↔QP \leftrightarrow Q is a formula inside the language whose truth varies with PP and QQ; P≡QP \equiv Q is a verdict about all cases at once. The bridge: P≡QP \equiv Q exactly when P↔QP \leftrightarrow Q is a tautology.
Same glyph elsewhereThe same triple bar states congruence in number theory — with a trailing modulus — and "identically equal" in algebra; three jobs, one stroke.
P⇔QP \Leftrightarrow Q
P if and only if Q — in the meta sense
The double-shafted arrow, an equally accepted spelling of the same meta-claim — \Leftrightarrow in LaTeX. The double shaft is the meta-marker: ⇔\Leftrightarrow stands above the language the single-shafted ↔\leftrightarrow lives inside.
CasesThe shaft convention runs in parallel one level down: ⇒\Rightarrow versus →\to on the implication page — double shafts talk about formulas, single shafts build them.
Do not confuseA stronger biconditional. ⇔\Leftrightarrow is not "very iff" — it is ≡\equiv in arrow costume; treating it as a connective puts a meta-mark inside a formula, which the formation rules never generate.
P=QP = Q
P equals Q — Boolean algebra's spelling
Boolean algebra writes equivalence with the plain equals sign — there, formulas denote values in {0,1}\{0, 1\} and equality of values is exactly agreement in all cases. Same claim, an algebraist's dialect.
CasesThe dialect travels with the algebra: simplification chains in circuit design and Boolean identities read P=QP = Q throughout; logic texts keep ≡\equiv to avoid overloading their own equals.
Do not confuseNumeric equality. P=QP = Q asserts nothing about numbers — the letters still hold truth values; importing arithmetic habits (adding to both sides) produces nonsense.
DownloadPNG2×PDF
Notation · Cheat sheet
Propositional Logic Notation at a Glance
The marks from the notation cards across the propositional-logic pages: how each is read and what it means. Every group links to the full card on its page.
Syntax
P,Q,RP, Q, R · P1,P2P_1, P_2
proposition letters
Capital letters name atomic propositions; subscripts extend the supply.
¬  ∧  ∨  →  ↔\neg \; \wedge \; \vee \; \to \; \leftrightarrow
not; and; or; implies; if and only if
The five connectives: negation, conjunction, disjunction, implication, biconditional.
φ,ψ\varphi, \psi
phi and psi
Placeholders for whole formulas in the formation rules.
(φ∧ψ)(\varphi \wedge \psi)
parenthesised conjunction
Every binary connective brings its own parentheses; no precedence at this level.
Implication
p→qp \to q
if p then q; p implies q
The conditional connective: antecedent pp, consequent qq.
p⇒qp \Rightarrow q
p implies q, in the meta sense
The double shaft claims the implication holds in every case; older texts write p⊃qp \supset q.
p→qp \to q in words
the English phrasings of one arrow
"if pp, then qq"; "pp is sufficient for qq"; "qq is necessary for pp"; "pp only if qq".
EquivalencesThis page
P≡QP \equiv Q
P is logically equivalent to Q
A claim about formulas: PP and QQ agree in every case.
P⇔QP \Leftrightarrow Q
P if and only if Q, in the meta sense
The double-shafted spelling of the same claim.
P=QP = Q
P equals Q
Boolean algebra’s spelling, where formulas denote values in {0,1}\{0, 1\}.
Tautology
⊤\top
top; verum; the true constant
Truth itself: a formula true under every assignment.
⊢P\vdash P
turnstile P; P is provable
The single turnstile: a derivation of PP exists in the proof system.
⊨P\vDash P
double turnstile P; P is valid
The double turnstile: PP is true under every assignment.
P≡⊤P \equiv \top
P is equivalent to the true constant
The third way to say that PP is a tautology.
Contradiction
⊥\bot
bottom; falsum; the false constant
Falsehood itself: a formula false under every assignment.
⊢¬P\vdash \neg P
the negation of P is provable
The proof-side way to declare PP a contradiction.
P≡⊥P \equiv \bot
P is equivalent to the false constant
The equivalence spelling of "contradiction".
Same marks, different job
→\to vs ⇒\RightarrowA connective inside a formula; a claim about formulas.
↔\leftrightarrow vs ≡\equivThe biconditional connective; logical equivalence in the metalanguage.
⊢\vdash vs ⊨\vDashProvable by the rules; true in every case.
⊃\supsetImplication in older logic texts; superset in set theory.
⊥\botThe false constant here; perpendicular in geometry.
Propositional Logic Notation at a Glance·/logic/propositional-logicLearn Math Class

How to Verify Logical Equivalence?

To verify that two logical statements PP and QQ are logically equivalent (P≡QP≡Q), we need to show that they always have the same truth value in all cases.
There are several methods to do this:

  1. 1.
    Truth Tables (Brute-Force Method):
    Construct a truth table for both expressions.
    Check if the final column values are identical for all possible truth values of the variables.
    If they match in every row, the expressions are logically equivalent.
    ✅ Best for: Propositional logic with a small number of variables.
    ❌ Not practical for more than 3-4 variables due to exponential growth in rows.
  2. 2.
    Algebraic Manipulation Using Logical Laws:
    Apply known logical equivalences (laws) (e.g., De Morgan’s laws, distributive, commutative, associative properties) to transform one statement into another.
    If you can rewrite PP into QQ (or vice versa), they are equivalent.
    ✅ Best for: Proofs and simplifying expressions without constructing tables.
    ❌ Requires familiarity with logical laws.
  3. 3.
    Using Logical Implications:
    Show that P→QP→Q and Q→PQ→P are both tautologies.
    If both implications are tautologies, then P≡QP≡Q.
    ✅ Best for: When equivalences involve implications.
    ❌ Requires proving two separate implications.
  4. 4.
    Venn Diagrams (Set-Theoretic Approach):
    Represent logical statements using sets and intersections/unions.
    If two statements cover the same region, they are equivalent.
    ✅ Best for: Visualizing logical expressions.
    ❌ Not practical for complex expressions.
Pitfall: Checking only some rows
Comparing p→qp \to q and q→pq \to p only at p=q=Tp = q = T and p=q=Fp = q = F, where both are T, makes them look equivalent. At p=Tp = T, q=Fq = F the first is F and the second is T, so they are not equivalent.
Whichever method is used, the claim being tested is the same: the two formulas agree in every row of the truth table. With nn variables there are 2n2^n rows, four for two variables and eight for three, and the verdict depends on all of them. A single row in which the two columns differ is enough to show that the formulas are not equivalent.
Every method tests the same claim, agreement in all 2n2^n rows, and one mismatched row is enough to refute it.

Fundamental Equivalences (Laws)

Some logical equivalences are considered laws of logic. A law is a fundamental equivalence—one that is taken as a basic principle, rather than something that needs to be proven from other rules.
On the other hand, many of logical equivalences, while being valid transformations, are not considered fundamental laws because they depend on definitions, are derived from the laws, or are specific to certain logical systems.

  • •
    Identity Laws:
    P∨false≡PP \lor \text{false} \equiv P,
    P∧true≡PP \land \text{true} \equiv P
  • •
    Domination Laws:
    P∨true≡trueP \lor \text{true} \equiv \text{true},
    P∧false≡falseP \land \text{false} \equiv \text{false}
  • •
    Idempotent Laws:
    P∨P≡PP \lor P \equiv P,
    P∧P≡PP \land P \equiv P
  • •
    Double Negation Law:
    ¬(¬P)≡P\neg (\neg P) \equiv P
  • •
    Commutative Laws:
    P∨Q≡Q∨PP \lor Q \equiv Q \lor P,
    P∧Q≡Q∧PP \land Q \equiv Q \land P
  • •
    Associative Laws:
    P∨(Q∨R)≡(P∨Q)∨RP \lor (Q \lor R) \equiv (P \lor Q) \lor R,
    P∧(Q∧R)≡(P∧Q)∧RP \land (Q \land R) \equiv (P \land Q) \land R
  • •
    Distributive Laws:
    P∧(Q∨R)≡(P∧Q)∨(P∧R)P \land (Q \lor R) \equiv (P \land Q) \lor (P \land R),
    P∨(Q∧R)≡(P∨Q)∧(P∨R)P \lor (Q \land R) \equiv (P \lor Q) \land (P \lor R)
  • •
    Absorption Laws:
    P∨(P∧Q)≡PP \lor (P \land Q) \equiv P,
    P∧(P∨Q)≡PP \land (P \lor Q) \equiv P
  • •
    De Morgan’s Laws:
    ¬(P∨Q)≡¬P∧¬Q\neg (P \lor Q) \equiv \neg P \land \neg Q,
    ¬(P∧Q)≡¬P∨¬Q\neg (P \land Q) \equiv \neg P \lor \neg Q
  • •
    Law of Excluded Middle:
    P∨¬P≡trueP \lor \neg P \equiv \text{true}
  • •
    Law of Non-Contradiction:
    P∧¬P≡falseP \land \neg P \equiv \text{false}
Pitfall: Keeping the connective in De Morgan's law
Rewriting ¬(P∧Q)\neg (P \land Q) as ¬P∧¬Q\neg P \land \neg Q fails at P=TP = T, Q=FQ = F: there ¬(P∧Q)\neg (P \land Q) is T but ¬P∧¬Q\neg P \land \neg Q is F. The negation flips the connective, so ¬(P∧Q)≡¬P∨¬Q\neg (P \land Q) \equiv \neg P \lor \neg Q.
De Morgan's laws are the tools for moving a negation inside brackets. They are needed whenever a negated compound has to be simplified, for example when stating exactly what it means for "the file is open and the disk is full" to fail. Each of the two laws is checked on four rows, one for each pair of truth values of PP and QQ.
For more information about laws of propositional logic, you can visit this page.
AB
Absorption: P ∧ (P ∨ Q) ≡ P

Read circle A as the cases where P is true and B as the cases where Q is true. P ∨ Q covers both circles; intersecting that with A leaves exactly A. The shaded region is the same as P alone, so the two formulas agree in every case and are logically equivalent. The part of B outside A is absorbed. Try the other absorption law on the Venn truth-table explorer.

Equivalent formulas always shade the same region: that is equivalence seen as a picture.
Fact: Every law has a mirror image
In any valid equivalence built from ¬\neg, ∧\land and ∨\lor, swapping ∧\land with ∨\lor and true\text{true} with false\text{false} gives another valid equivalence. Negating both sides and pushing the negations inward with De Morgan's laws turns a law into its mirror, so every law proved gives a second one free.
Most of the laws in the list come in pairs. The identity, domination, idempotent, commutative, associative, distributive and absorption laws, and De Morgan's laws, each have one version with ∨\lor and one with ∧\land, and inside each pair the constants true\text{true} and false\text{false} trade places as well. The law of excluded middle and the law of non-contradiction form such a pair too, even though they carry different names. Only the double negation law, which contains neither connective, stands alone.
Learn More

Equivalences with Implications

In propositional logic, a conditional statement (implication) is written as:
P→QP→Q
which means "if PP, then QQ".
However, implications can be rewritten using logical equivalences.
Here are the key ones:

nameequivalenceexplanation
Material Implication
p→q≡¬p∨qp \rightarrow q \equiv \neg p \lor q
"if pp then qq" is the same as saying "either pp is false or qq is true."
Contrapositive
p→q≡¬q→¬pp \rightarrow q \equiv \neg q \rightarrow \neg p
Reversing and negating an implication produces an equivalent statement.
Disjunction Form of Implication
p∨q≡¬p→qp \lor q \equiv \neg p \rightarrow q
A disjunction can be rewritten as an implication.
Implication as a Conjunction
p∧q≡¬(p→¬q)p \land q \equiv \neg (p \rightarrow \neg q)
A conjunction can be expressed using an implication and negation.
Negation of an Implication
¬(p→q)≡p∧¬q\neg (p \rightarrow q) \equiv p \land \neg q
An implication is false only when the antecedent is true and the consequent is false.
Implication Distribution over Conjunction
(p→q)∧(p→r)≡p→(q∧r)(p \rightarrow q) \land (p \rightarrow r) \equiv p \rightarrow (q \land r)
If pp implies both qq and rr, then it implies their conjunction.
Implications with a Common Consequent
(p→r)∧(q→r)≡(p∨q)→r(p \rightarrow r) \land (q \rightarrow r) \equiv (p \lor q) \rightarrow r
If both pp and qq imply rr, then their disjunction also implies rr.
Implication Distribution over Disjunction
(p→q)∨(p→r)≡p→(q∨r)(p \rightarrow q) \lor (p \rightarrow r) \equiv p \rightarrow (q \lor r)
If pp implies either qq or rr, then pp implies their disjunction.
Nested Implications in a Conjunction
(p→r)∨(q→r)≡(p∧q)→r(p \rightarrow r) \lor (q \rightarrow r) \equiv (p \land q) \rightarrow r
If either pp or qq implies rr, then their conjunction implies rr.
Pitfall: Negating an implication into an implication
Writing ¬(p→q)\neg (p \to q) as p→¬qp \to \neg q fails at p=Fp = F, q=Tq = T: there ¬(p→q)\neg (p \to q) is F but p→¬qp \to \neg q is T. The negation is a conjunction, ¬(p→q)≡p∧¬q\neg (p \to q) \equiv p \land \neg q.
Negating a conditional comes up whenever a claim of the form "if pp, then qq" has to be refuted. To deny such a claim is to describe the cases in which it fails, and the truth table of p→qp \to q has exactly one such row. Material implication turns the arrow into ¬p∨q\neg p \lor q, and from there De Morgan's law carries the negation inside.

Pitfall: Joining the antecedents with AND
Rewriting (p→r)∧(q→r)(p \to r) \land (q \to r) as (p∧q)→r(p \land q) \to r fails at p=Tp = T, q=Fq = F, r=Fr = F: the left side is F, the right side is T. Joined by ∧\land, the two implications combine their antecedents with ∨\lor: (p∨q)→r(p \lor q) \to r.
Four of the equivalences in the table merge two implications that share one part into a single implication. When the shared part is the antecedent pp, the connective between the two implications passes to the consequents unchanged. In the other two the shared part is the consequent rr, and the parts being combined are the antecedents.
The negation of a conditional, carried inside by the two moves named above: material implication, then De Morgan's law.
DownloadPNG2×PDF
Equivalences with implications

Negating a conditional

To deny "if p, then q" is to describe the cases in which it fails, and the truth table of p → q has exactly one such row.
01
Negated implicationBefore
¬(p→q)\neg (p \to q)
↓Material implication— p → q ≡ ¬p ∨ q
02
Negated disjunction
¬(¬p∨q)\neg (\neg p \lor q)
↓De Morgan's law— the negation goes inside and ∨ becomes ∧
03
Double negation inside
¬¬p∧¬q\neg \neg p \land \neg q
↓Drop the double negation— ¬¬p ≡ p
04
A single conjunctionAfter
p∧¬qp \land \neg q
Writing ¬(p→q)\neg (p \to q) as p→¬qp \to \neg q fails at p=Fp = F, q=Tq = T: there ¬(p→q)\neg (p \to q) is F but p→¬qp \to \neg q is T. The negation is a conjunction, ¬(p→q)≡p∧¬q\neg (p \to q) \equiv p \land \neg q.
Negating a conditional, step by step·/logic/propositional-logic/semantics/equivalencesLearn Math Class
The result, p∧¬qp \land \neg q, is true in exactly one row, p=Tp = T, q=Fq = F: the one row where p→qp \to q is false.

All logical equivalences involving implications provide ways to rewrite conditional statements in different but logically identical forms. A common theme among them is restructuring the relationship between the antecedent (pp) and the consequent (qq) using negation, disjunction, or conjunction while preserving truth values. These transformations help simplify logical expressions and proofs.
Fact: One connective is enough
NAND, p↑q≡¬(p∧q)p \uparrow q \equiv \neg (p \land q), can express every other connective: ¬p≡p↑p\neg p \equiv p \uparrow p and p∧q≡(p↑q)↑(p↑q)p \land q \equiv (p \uparrow q) \uparrow (p \uparrow q), and ¬\neg with ∧\land already give the rest. Peirce found this around 1880 but never published it; today it lets whole chips be built from NAND gates alone.
Rows 1, 3 and 4 of the table translate between the arrow and the other connectives: p→qp \to q becomes ¬p∨q\neg p \lor q, p∨qp \lor q becomes ¬p→q\neg p \to q, and p∧qp \land q becomes ¬(p→¬q)\neg (p \to \neg q). With these rewrites, any formula can be expressed using only ¬\neg and →\to, and the remaining connectives become shorthand for longer formulas. Many logic textbooks start from such a small set of connectives and define all the others through equivalences like these. The fewer connectives a system starts from, the fewer cases its proofs about formulas have to cover.

Equivalences with Biconditionals

Logical equivalences involving biconditional statements (p↔qp↔q) focus on expressing the mutual dependence of two propositions in different but logically equivalent ways. The biconditional means "p if and only if q," meaning both must have the same truth value (either both true or both false).
Here are some equivalences involving biconditional statements:

nameequivalenceexplanation
Biconditional as Two Implications
p↔q≡(p→q)∧(q→p)p \leftrightarrow q \equiv (p \rightarrow q) \land (q \rightarrow p)
A biconditional means both directions of implication must be true.
Negation Preservation in Biconditional
p↔q≡¬p↔¬qp \leftrightarrow q \equiv \neg p \leftrightarrow \neg q
Negating both sides of a biconditional does not change its truth value.
Biconditional in Terms of AND and OR
p↔q≡(p∧q)∨(¬p∧¬q)p \leftrightarrow q \equiv (p \land q) \lor (\neg p \land \neg q)
Two statements are equivalent if both are true or both are false.
Negation of a Biconditional
¬(p↔q)≡p↔¬q\neg (p \leftrightarrow q) \equiv p \leftrightarrow \neg q
Negating a biconditional swaps one side, making it an XOR.
Pitfall: Negating both sides of a biconditional
Taking ¬p↔¬q\neg p \leftrightarrow \neg q as the negation of p↔qp \leftrightarrow q fails at p=q=Tp = q = T: there ¬(p↔q)\neg (p \leftrightarrow q) is F but ¬p↔¬q\neg p \leftrightarrow \neg q is T. Negating one side gives the negation: ¬(p↔q)≡p↔¬q\neg (p \leftrightarrow q) \equiv p \leftrightarrow \neg q.
The biconditional is true exactly when its two sides have the same truth value, so its negation is true exactly when they differ. Two rows of the table above place negation signs at the sides of a biconditional, and they do different things: one leaves the truth value unchanged, the other turns it into its opposite. A negation written outside the brackets, ¬(p↔q)\neg (p \leftrightarrow q), describes the rows p=Tp = T, q=Fq = F and p=Fp = F, q=Tq = T.

Conclusion on Biconditional Equivalences
Biconditional equivalences highlight the fundamental symmetry in logic: two statements are logically interchangeable if and only if they always have the same truth value. These equivalences allow us to express p↔qp \leftrightarrow q in different but logically equivalent ways, making it easier to manipulate and analyze logical statements.
- They break down into implications, showing that mutual implication defines equivalence.
- They connect to conjunction and disjunction, emphasizing that two statements are equivalent when they share truth values.
- Negating a biconditional results in an XOR, reinforcing that logical opposition emerges when one statement is true and the other is false.

In formal logic, these properties make biconditionals a powerful tool for proofs, simplifications, and logical reasoning across mathematics, philosophy, and computing.

Common Pitfalls

Five slips account for many wrong answers when equivalences are checked or used. Each is marked where it happens in the sections above; here each is worked through in full, with the wrong and the right working side by side.
DownloadPNG2×PDF
1Checking only some rows
Two formulas are compared on a few convenient rows of the truth table, they agree there, and they are declared equivalent. Equivalence is a claim about every row, so agreement on some of them proves nothing.
Wrong turn
Error here
For p→qp \to q and q→pq \to p, take p=q=Tp = q = T: both are T. Take p=q=Fp = q = F: both are T. The two formulas agree, so p→q≡q→pp \to q \equiv q \to p.
Right path
Two variables give four rows. For (p,q)(p, q) equal to (T,T)(T, T), (T,F)(T, F), (F,T)(F, T), (F,F)(F, F), the formula p→qp \to q takes the values T, F, T, T and q→pq \to p takes T, T, F, T. The columns differ in the rows (T,F)(T, F) and (F,T)(F, T), so the formulas are not equivalent: q→pq \to p is the converse of p→qp \to q.
Why it happensThe rows where both variables have the same value are the easiest to evaluate, and agreement there feels like evidence. A truth table settles equivalence only when it is complete.
How to checkCount the rows first, 2n2^n for nn variables, and fill in every one. To refute an equivalence, one row with different values is enough; to confirm it, all 2n2^n rows must match.
2Keeping the connective in De Morgan's law
The negation in front of a bracket is passed to each part inside, but the connective between the parts is left as it was. The result is not equivalent to the original formula.
Wrong turn
Error here
To simplify ¬(P∧Q)\neg (P \land Q), apply the negation to each part, giving ¬P\neg P and ¬Q\neg Q, and keep the ∧\land between them: ¬(P∧Q)≡¬P∧¬Q\neg (P \land Q) \equiv \neg P \land \neg Q.
Right path
At P=TP = T, Q=FQ = F, the conjunction P∧QP \land Q is F, so ¬(P∧Q)\neg (P \land Q) is T, while ¬P∧¬Q\neg P \land \neg Q is F∧TF \land T, which is F. De Morgan's law changes the connective: ¬(P∧Q)≡¬P∨¬Q\neg (P \land Q) \equiv \neg P \lor \neg Q, and ¬P∨¬Q\neg P \lor \neg Q is F∨TF \lor T, which is T in that row. In the same way, ¬(P∨Q)≡¬P∧¬Q\neg (P \lor Q) \equiv \neg P \land \neg Q.
Why it happensThe negation is treated like a minus sign multiplied into a bracket, as in −(a+b)=−a+(−b)-(a + b) = -a + (-b), where the operation between the terms keeps its form. In words, "not both" gets heard as "neither".
How to checkTest the row P=TP = T, Q=FQ = F. "Not both PP and QQ" is true there, because QQ is false, so the rewritten form must be T in that row too.
3Negating an implication into an implication
Asked to negate "if pp, then qq", the learner moves the negation onto the consequent and keeps the arrow, writing p→¬qp \to \neg q. That formula is a different implication, not the negation.
Wrong turn
Error here
¬(p→q)≡p→¬q\neg (p \to q) \equiv p \to \neg q, so the negation of "if it rains, the ground is wet" would be "if it rains, the ground is not wet".
Right path
Rewrite with material implication and De Morgan's law: ¬(p→q)≡¬(¬p∨q)≡¬¬p∧¬q≡p∧¬q\neg (p \to q) \equiv \neg (\neg p \lor q) \equiv \neg \neg p \land \neg q \equiv p \land \neg q. The wrong form fails at p=Fp = F, q=Tq = T: there p→qp \to q is T, so ¬(p→q)\neg (p \to q) is F, but p→¬qp \to \neg q is F→FF \to F, which is T. The negation is "it rains and the ground is not wet".
Why it happensIn everyday speech, "it is not true that if it rains the ground is wet" sounds like a claim about what happens when it rains, so the "if" is kept. The negation of a conditional states a single case: the one row where p→qp \to q is F.
How to checkThe negation of a formula must be T exactly where the formula is F. p→qp \to q is F only at p=Tp = T, q=Fq = F, so its negation must be T in that row and F in the other three. p∧¬qp \land \neg q passes this test; p→¬qp \to \neg q fails it, being T in both rows with p=Fp = F.
4Joining the antecedents with AND
Two implications with the same consequent, (p→r)∧(q→r)(p \to r) \land (q \to r), are merged by joining their antecedents with ∧\land, the connective that stands between the two implications. With a shared consequent the connective changes.
Wrong turn
Error here
By analogy with (p→q)∧(p→r)≡p→(q∧r)(p \to q) \land (p \to r) \equiv p \to (q \land r), write (p→r)∧(q→r)≡(p∧q)→r(p \to r) \land (q \to r) \equiv (p \land q) \to r.
Right path
At p=Tp = T, q=Fq = F, r=Fr = F, the implication p→rp \to r is F, so the left side is F, while (p∧q)→r(p \land q) \to r is F→FF \to F, which is T. With material implication and the distributive law: (¬p∨r)∧(¬q∨r)≡(¬p∧¬q)∨r≡¬(p∨q)∨r≡(p∨q)→r(\neg p \lor r) \land (\neg q \lor r) \equiv (\neg p \land \neg q) \lor r \equiv \neg (p \lor q) \lor r \equiv (p \lor q) \to r.
Why it happensThe equivalences for a shared antecedent keep the connective, and the same is expected of a shared consequent. But once the arrow is rewritten, p→r≡¬p∨rp \to r \equiv \neg p \lor r, the antecedent stands under a negation, and De Morgan's law turns the connective over.
How to checkRead it in words. "If it rains, the ground is wet, and if the sprinkler runs, the ground is wet" means the ground is wet when either one happens, which is (p∨q)→r(p \lor q) \to r. Or test the row p=Tp = T, q=Fq = F, r=Fr = F.
5Negating both sides of a biconditional
To negate p↔qp \leftrightarrow q, the negation is put on both sides, giving ¬p↔¬q\neg p \leftrightarrow \neg q. That formula is equivalent to p↔qp \leftrightarrow q itself, so it has the opposite value of the negation in every row.
Wrong turn
Error here
¬(p↔q)≡¬p↔¬q\neg (p \leftrightarrow q) \equiv \neg p \leftrightarrow \neg q.
Right path
At p=q=Tp = q = T, p↔qp \leftrightarrow q is T, so ¬(p↔q)\neg (p \leftrightarrow q) is F, but ¬p↔¬q\neg p \leftrightarrow \neg q is F↔FF \leftrightarrow F, which is T. The negation goes on one side only: ¬(p↔q)≡p↔¬q≡¬p↔q\neg (p \leftrightarrow q) \equiv p \leftrightarrow \neg q \equiv \neg p \leftrightarrow q, true exactly when pp and qq differ.
Why it happensThe negation is distributed over the biconditional as if it were multiplied into a bracket. The row Negation Preservation in Biconditional in the table shows that negating both sides changes nothing, which is exactly why it cannot produce the negation.
How to checkCount the negations. A negation on one side flips the value of the biconditional, so two of them cancel and one negates. Test p=q=Tp = q = T: the negation must be F there.
Common pitfalls with logical equivalences·/logic/propositional-logic/semantics/equivalencesLearn Math Class
Each slip treats an equivalence more loosely than the truth table allows. An equivalence must hold in all 2n2^n rows, De Morgan's law swaps ∧\land and ∨\lor, the negation of p→qp \to q is p∧¬qp \land \neg q, two implications into the same rr combine into (p∨q)→r(p \lor q) \to r, and a biconditional is negated on one side only. A single row where the two sides differ refutes the claim, and the row p=Tp = T, q=Fq = F is the one to try first.

Logical Equivalence FAQ

What is the difference between ≡ and ↔ in logic?

+
The triple bar ≡ makes a claim about two formulas: P ≡ Q says they agree in every possible case, so it is itself always simply true or false. The single arrow ↔ is a connective inside the language, and the truth of P ↔ Q varies with its components. The bridge between them: P ≡ Q holds exactly when P ↔ Q is a tautology.Read more →

What is material implication?

+
Material implication is the equivalence p → q ≡ ¬p ∨ q: the statement "if p then q" says exactly that either p is false or q is true. Both sides are false in only one case — p true and q false — so their truth values always match. The rewrite removes the arrow, so implications can be simplified using the laws of logic for AND, OR, and NOT.Read more →

What is the negation of an implication?

+
The negation of p → q is p ∧ ¬q: the antecedent true and the consequent false. That is the single row of the truth table where an implication fails, so denying "if p then q" asserts exactly that case. The negation of an implication is a conjunction — not another implication, and not p → ¬q, a frequent mistake.Read more →

What is the negation of a biconditional?

+
Negating a biconditional produces an exclusive or: ¬(p ↔ q) ≡ p ↔ ¬q, true exactly when p and q have different truth values. A biconditional asserts that both statements match — both true or both false — so its denial asserts a mismatch: one true and the other false. Attaching the negation to either side gives the same equivalent result.Read more →

Is (p → r) ∧ (q → r) equivalent to (p ∧ q) → r?

+
No, the antecedents join with OR: (p→r)∧(q→r)≡(p∨q)→r(p \to r) \land (q \to r) \equiv (p \lor q) \to r. At p=Tp = T, q=Fq = F, r=Fr = F the left side is F, because p→rp \to r fails, while (p∧q)→r(p \land q) \to r is T. Rewriting each arrow as ¬p∨r\neg p \lor r shows why: the antecedents stand under a negation, and De Morgan's law turns the connective over.Read more →

Can every logical connective be built from NAND?

+
Yes. With p↑q≡¬(p∧q)p \uparrow q \equiv \neg (p \land q), negation is ¬p≡p↑p\neg p \equiv p \uparrow p and conjunction is p∧q≡(p↑q)↑(p↑q)p \land q \equiv (p \uparrow q) \uparrow (p \uparrow q), and ¬\neg with ∧\land already express every other connective. Peirce found this around 1880 but never published it; today it lets whole chips be built from NAND gates alone.Read more →

What is the duality principle in logic?

+
It says that swapping ∧\land with ∨\lor and true\text{true} with false\text{false} in a valid equivalence built from ¬\neg, ∧\land and ∨\lor gives another valid equivalence. That is why the laws come in pairs, such as the two De Morgan's laws or the two absorption laws, and why proving one law of a pair gives the other free. Only the double negation law, with neither connective, stands alone.Read more →