{
  "aliases": [
    "equisatisfiable"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn 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:\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "equisatisfiable"
    ],
    "inventory": [
      "G7XH6MR18A"
    ],
    "kind": "concept",
    "name": "Equisatisfiability",
    "same_as": {
      "wikidata": "Q2402183",
      "wikipedia": "Equisatisfiability"
    },
    "sources": [
      {
        "locator": "Equisatisfiability",
        "mention": "wikipedia://en/15895296",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:15895296@r1339062933"
      }
    ],
    "tag": "B37TYWXS74"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/B37TYWXS74/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/B37TYWXS74.md",
  "msc": null,
  "name": "Equisatisfiability",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/B37/B37TYWXS74.md",
  "status": null,
  "tag": "B37TYWXS74",
  "uri": "m2://B37TYWXS74",
  "url": "https://math2.tamnd.com/wiki/equisatisfiability/",
  "writing": {
    "tag": "B37TYWXS74",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}
