{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nGödel's completeness theorem establishes an equivalence in first-order logic between the formal provability of a formula and its truth in all possible models. Precisely, for any consistent first-order theory it gives an \"explicit construction\" of a model described by the theory; this model will be countable if the language of the theory is countable. However this \"explicit construction\" is not algorithmic. It is based on an iterative process of completion of the theory, where each step of the iteration consists in adding a formula to the axioms if it keeps the theory consistent; but this consistency question is only semi-decidable (an algorithm is available to find any contradiction but if there is none this consistency fact can remain unprovable).\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "inventory": [
      "CKWNTQXYY5"
    ],
    "kind": "statement",
    "name": "Philosophical consequences of Gödel's completeness theorem",
    "role": "theorem",
    "sources": [
      {
        "locator": "Foundations of mathematics, section Foundational crisis \u003e Philosophical views \u003e Philosophical consequences of Gödel's completeness theorem",
        "mention": "wikipedia://en/169358#V8IL",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:169358@r1375962285"
      }
    ],
    "tag": "DP717VX73G"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/DP717VX73G/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/DP717VX73G.md",
  "msc": null,
  "name": "Philosophical consequences of Gödel's completeness theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/DP7/DP717VX73G.md",
  "status": null,
  "tag": "DP717VX73G",
  "uri": "m2://DP717VX73G",
  "url": "https://math2.tamnd.com/wiki/philosophical-consequences-of-godels-completeness-theorem/",
  "writing": {
    "tag": "DP717VX73G",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}