---
tag: B37TYWXS74
kind: concept
name: Equisatisfiability
aliases: [equisatisfiable]
sources:
  - wikipedia: en:15895296@r1339062933
    locator: Equisatisfiability
    note: adopted
    mention: wikipedia://en/15895296
    sections: [Summary]
same_as:
  wikidata: Q2402183
  wikipedia: Equisatisfiability
inventory: [G7XH6MR18A]
---

## Summary

In mathematical logic (a subtopic within the field of formal logic), two formulae are **equisatisfiable** if the first formula is satisfiable whenever the second is and vice versa; in other words, either both formulae are satisfiable or neither is. The truth values of two equisatisfiable formulae may nevertheless disagree for a particular assignment of variables. As a result, equisatisfiability differs from [[logical equivalence|06GYGS41JK]], since two equivalent formulae always have the same models, whereas equisatisfiable ones need only share satisfiability status. More formally, the equisatisfiability meta formula $f$ is true if either the two subformulae are both satisfiable or if they both are not: