{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Definition\n\nLet $\\{e\\}$ denote the partial [[computable function|KZSB5E471K]] with code $e \\in \\N$, and write $\\{e\\}(n)\\downarrow$ when it is defined at $n$.\nFix a computable pairing of natural numbers with projections $(e)_0$ and $(e)_1$.\n*Number realizability* is the relation \"$e$ realizes $A$\", written $e \\Vdash A$, between a number $e$ and a closed formula $A$ of [[Heyting arithmetic|RXHJPVMPJH]].\nIt is defined by induction on $A$.\n\n1. $e \\Vdash (s = t)$ if $s = t$ is true. No number realizes $0 = 1$.\n2. $e \\Vdash A \\wedge B$ if $(e)_0 \\Vdash A$ and $(e)_1 \\Vdash B$.\n3. $e \\Vdash A \\vee B$ if either $(e)_0 = 0$ and $(e)_1 \\Vdash A$, or $(e)_0 \\ne 0$ and $(e)_1 \\Vdash B$.\n4. $e \\Vdash A \\to B$ if for every $n$ with $n \\Vdash A$, $\\{e\\}(n)\\downarrow$ and $\\{e\\}(n) \\Vdash B$.\n5. $e \\Vdash \\exists x\\, A(x)$ if $(e)_1 \\Vdash A(\\overline{(e)_0})$, where $\\overline{k}$ is the numeral of $k$.\n6. $e \\Vdash \\forall x\\, A(x)$ if for every $n$, $\\{e\\}(n)\\downarrow$ and $\\{e\\}(n) \\Vdash A(\\overline{n})$.\n\nA closed formula is *realizable* if some number realizes it.\nNegation $\\neg A$ is read as $A \\to (0 = 1)$.\n\n## Remarks\n\nSoundness theorem (Kleene): if Heyting arithmetic proves a closed formula $A$, then $A$ is realizable.\nExample: $\\forall x\\, \\exists y\\, (y = x + x)$ is realized by a code $e$ of a total function with $\\{e\\}(n) = \\langle 2n, 0 \\rangle$.\nIndeed, $\\{e\\}(n)$ is defined, its first part is $2n$, and its second part realizes the true equation $2n = n + n$ by clause 1.\nNon-example: let $H(x)$ say that the program $x$ halts on input $x$.\nA realizer of $\\forall x\\, (H(x) \\vee \\neg H(x))$ would compute, from $x$, a bit telling whether $H(x)$ holds, and so solve the halting problem.\nSo this instance of the law of excluded middle is not realizable, and hence not provable in Heyting arithmetic.\nMany variants exist, such as realizability by functions, by terms of a typed calculus, and in toposes.\n",
  "commit": "547b6eddb8f2feb8d579f2d633d22a27b7e132fc",
  "front": {
    "defines": "4H35VQ16DC",
    "kind": "definition",
    "msc": [
      "03F50",
      "03F55",
      "03D80"
    ],
    "name": "Realizability",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Realizability"
      }
    ],
    "tag": "E6MB6B3YQ0",
    "uses": [
      "RXHJPVMPJH",
      "CK8ZQRN183",
      "KZSB5E471K",
      "7B53ZGXXEQ"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/E6MB6B3YQ0/",
  "links": [
    {
      "field": "defines",
      "target": "4H35VQ16DC"
    },
    {
      "field": "uses",
      "target": "RXHJPVMPJH"
    },
    {
      "field": "uses",
      "target": "CK8ZQRN183"
    },
    {
      "field": "uses",
      "target": "KZSB5E471K"
    },
    {
      "field": "uses",
      "target": "7B53ZGXXEQ"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/E6MB6B3YQ0.md",
  "msc": [
    "03F50",
    "03F55",
    "03D80"
  ],
  "name": "Realizability",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/E6M/E6MB6B3YQ0.md",
  "status": null,
  "tag": "E6MB6B3YQ0",
  "uri": "m2://E6MB6B3YQ0",
  "url": "https://math2.tamnd.com/wiki/realizability-definition/",
  "writing": {
    "tag": "E6MB6B3YQ0",
    "kind": "definition",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}