Misplaced Pages

In logic and mathematics, statements ${\displaystyle p}$ and ${\displaystyle q}$ are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of ${\displaystyle p}$ and ${\displaystyle q}$ is sometimes expressed as ${\displaystyle p\equiv q}$, ${\displaystyle p::q}$, ${\displaystyle {\textsf {E}}pq}$, or ${\displaystyle p\iff q}$, depending on the notation being used. However, these symbols are also used for material equivalence, so proper interpretation would depend on the context. Logical equivalence is different from material equivalence, although the two concepts are intrinsically related.

Logical equivalences

In logic, many common logical equivalences exist and are often listed as laws or properties. The following tables illustrate some of these.

General logical equivalences

Equivalence	Name
${\displaystyle p\wedge \top \equiv p}$ ${\displaystyle p\vee \bot \equiv p}$	Identity laws
${\displaystyle p\vee \top \equiv \top }$ ${\displaystyle p\wedge \bot \equiv \bot }$	Domination laws
${\displaystyle p\vee p\equiv p}$ ${\displaystyle p\wedge p\equiv p}$	Idempotent or tautology laws
${\displaystyle \neg (\neg p)\equiv p}$	Double negation law
${\displaystyle p\vee q\equiv q\vee p}$ ${\displaystyle p\wedge q\equiv q\wedge p}$	Commutative laws
${\displaystyle (p\vee q)\vee r\equiv p\vee (q\vee r)}$ ${\displaystyle (p\wedge q)\wedge r\equiv p\wedge (q\wedge r)}$	Associative laws
${\displaystyle p\vee (q\wedge r)\equiv (p\vee q)\wedge (p\vee r)}$ ${\displaystyle p\wedge (q\vee r)\equiv (p\wedge q)\vee (p\wedge r)}$	Distributive laws
${\displaystyle \neg (p\wedge q)\equiv \neg p\vee \neg q}$ ${\displaystyle \neg (p\vee q)\equiv \neg p\wedge \neg q}$	De Morgan's laws
${\displaystyle p\vee (p\wedge q)\equiv p}$ ${\displaystyle p\wedge (p\vee q)\equiv p}$	Absorption laws
${\displaystyle p\vee \neg p\equiv \top }$ ${\displaystyle p\wedge \neg p\equiv \bot }$	Negation laws

Logical equivalences involving conditional statements

1. ${\displaystyle p\implies q\equiv \neg p\vee q}$
2. ${\displaystyle p\implies q\equiv \neg q\implies \neg p}$
3. ${\displaystyle p\vee q\equiv \neg p\implies q}$
4. ${\displaystyle p\wedge q\equiv \neg (p\implies \neg q)}$
5. ${\displaystyle \neg (p\implies q)\equiv p\wedge \neg q}$
6. ${\displaystyle (p\implies q)\wedge (p\implies r)\equiv p\implies (q\wedge r)}$
7. ${\displaystyle (p\implies q)\vee (p\implies r)\equiv p\implies (q\vee r)}$
8. ${\displaystyle (p\implies r)\wedge (q\implies r)\equiv (p\vee q)\implies r}$
9. ${\displaystyle (p\implies r)\vee (q\implies r)\equiv (p\wedge q)\implies r}$

Logical equivalences involving biconditionals

1. ${\displaystyle p\iff q\equiv (p\implies q)\wedge (q\implies p)}$
2. ${\displaystyle p\iff q\equiv \neg p\iff \neg q}$
3. ${\displaystyle p\iff q\equiv (p\wedge q)\vee (\neg p\wedge \neg q)}$
4. ${\displaystyle \neg (p\iff q)\equiv p\iff \neg q\equiv p\oplus q}$

Where ${\displaystyle \oplus }$ represents XOR.

Examples

In logic

The following statements are logically equivalent:

1. If Lisa is in Denmark, then she is in Europe (a statement of the form ${\displaystyle d\implies e}$).
2. If Lisa is not in Europe, then she is not in Denmark (a statement of the form ${\displaystyle \neg e\implies \neg d}$).

Syntactically, (1) and (2) are derivable from each other via the rules of contraposition and double negation. Semantically, (1) and (2) are true in exactly the same models (interpretations, valuations); namely, those in which either Lisa is in Denmark is false or Lisa is in Europe is true.

(Note that in this example, classical logic is assumed. Some non-classical logics do not deem (1) and (2) to be logically equivalent.)

Relation to material equivalence

Logical equivalence is different from material equivalence. Formulas ${\displaystyle p}$ and ${\displaystyle q}$ are logically equivalent if and only if the statement of their material equivalence (${\displaystyle p\leftrightarrow q}$) is a tautology.

The material equivalence of ${\displaystyle p}$ and ${\displaystyle q}$ (often written as ${\displaystyle p\leftrightarrow q}$) is itself another statement in the same object language as ${\displaystyle p}$ and ${\displaystyle q}$. This statement expresses the idea "'${\displaystyle p}$ if and only if ${\displaystyle q}$'". In particular, the truth value of ${\displaystyle p\leftrightarrow q}$ can change from one model to another.

On the other hand, the claim that two formulas are logically equivalent is a statement in metalanguage, which expresses a relationship between two statements ${\displaystyle p}$ and ${\displaystyle q}$. The statements are logically equivalent if, in every model, they have the same truth value.

See also

• Entailment
• Equisatisfiability
• If and only if
• Logical biconditional
• Logical equality
• ≡ the iff symbol (U+2261 IDENTICAL TO)
• ∷ the a is to b as c is to d symbol (U+2237 PROPORTION)
• ⇔ the double struck biconditional (U+21D4 LEFT RIGHT DOUBLE ARROW)
• ↔ the bidirectional arrow (U+2194 LEFT RIGHT ARROW)

References

1. Mendelson, Elliott (1979). Introduction to Mathematical Logic (2 ed.). pp. 56. ISBN 9780442253073.
2. Copi, Irving; Cohen, Carl; McMahon, Kenneth (2014). Introduction to Logic (New International ed.). Pearson. p. 348.

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Mathematical logic
• Metalogic
• Logical consequence
• Equivalence (mathematics)