{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "MKY6BQHRJM"
    }
  ],
  "body": "\n## Summary\n\nUnification is the problem of finding a [[substitution|NCDZ969V7X]] that makes two terms equal.\nSuch a substitution is a unifier.\nWhen two terms have a unifier, they have a most general one, from which every other unifier is obtained by a further substitution.\nRobinson's unification algorithm computes it, and unification is at the core of resolution theorem proving, logic programming and type inference.\n\n## Explanations\n\n### L1 human\n\nTwo expressions with blanks are given, and the task is to fill in the blanks so that the two become the same expression.\nFor example, $f(x, b)$ and $f(a, y)$ become the same once $x$ is replaced by $a$ and $y$ by $b$.\nThe expressions $f(x)$ and $g(y)$ can never be made equal, because their outer symbols differ.\nNeither can $x$ and $f(x)$, because $x$ would have to contain itself.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "68V15",
      "03B35",
      "08B05"
    ],
    "name": "Unification",
    "same_as": {
      "wikidata": "Q609057",
      "wikipedia": "Unification (computer science)"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Unification_(computer_science)"
      }
    ],
    "tag": "RJJ9D0WF53"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/RJJ9D0WF53/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/RJJ9D0WF53.md",
  "msc": [
    "68V15",
    "03B35",
    "08B05"
  ],
  "name": "Unification",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/RJJ/RJJ9D0WF53.md",
  "status": null,
  "tag": "RJJ9D0WF53",
  "uri": "m2://RJJ9D0WF53",
  "url": "https://tamnd.github.io/math2/wiki/unification/",
  "writing": {
    "tag": "RJJ9D0WF53",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}