{
  "aliases": [
    "formal-theorem",
    "logical-theorem",
    "theorem-logic"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nIn mathematical logic, a formal theory is a set of sentences within a formal language. A sentence is a well-formed formula with no free variables. A sentence that is a member of a theory is one of its theorems, and the theory is the set of its theorems. Usually a theory is understood to be closed under the relation of logical consequence. Some accounts define a theory to be closed under the semantic consequence relation ($\\models$), while others define it to be closed under the syntactic consequence, or derivability relation ($\\vdash$).\n\nFor a theory to be closed under a derivability relation, it must be associated with a deductive system that specifies how the theorems are derived. The deductive system may be stated explicitly, or it may be clear from the context. The closure of the empty set under the relation of logical consequence yields the set that contains just those sentences that are the theorems of the deductive system.\n\nIn the broad sense in which the term is used within logic, a theorem does not have to be true, since the theory that contains it may be unsound relative to a given semantics, or relative to the standard interpretation of the underlying language. A theory that is inconsistent has all sentences as theorems.\n\nThe definition of theorems as sentences of a formal language is useful within proof theory, which is a branch of mathematics that studies the structure of formal proofs and the structure of provable formulas. It is also important in model theory, which is concerned with the relationship between formal theories and structures that are able to provide a semantics for them through interpretation.\n\nAlthough theorems may be uninterpreted sentences, in practice mathematicians are more interested in the meanings of the sentences, i.e. in the propositions they express. What makes formal theorems useful and interesting is that they may be interpreted as true propositions and their derivations may be interpreted as a proof of their truth. A theorem whose interpretation is a true statement *about* a formal system (as opposed to *within* a formal system) is called a *metatheorem*.\n\nSome important theorems in mathematical logic are:\n\n- Compactness of first-order logic\n- Completeness of first-order logic\n- Gödel's incompleteness theorems of first-order arithmetic\n- Consistency of first-order arithmetic\n- Tarski's undefinability theorem\n- Church-Turing theorem of undecidability\n- Löb's theorem\n- Löwenheim–Skolem theorem\n- Lindström's theorem\n- Craig's theorem\n- Cut-elimination theorem\n\nThe concept of a formal theorem is fundamentally syntactic, in contrast to the notion of a *true proposition,* which introduces semantics. Different deductive systems can yield other interpretations, depending on the presumptions of the derivation rules (i.e. belief, justification or other modalities). The soundness of a formal system depends on whether or not all of its theorems are also validities. A validity is a formula that is true under any possible interpretation (for example, in classical propositional logic, validities are [[tautologies|05006AJ7DZ]]). A formal system is considered semantically complete when all of its theorems are also tautologies.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "formal-theorem",
      "logical-theorem",
      "theorem-logic"
    ],
    "inventory": [
      "HSFSK36D6Y"
    ],
    "kind": "statement",
    "name": "Theorems in logic",
    "role": "theorem",
    "sources": [
      {
        "locator": "Theorem, section Theorems in logic",
        "mention": "wikipedia://en/30977#ZNUT",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:30977@r1360039713"
      }
    ],
    "tag": "2MXQJX37DD"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/2MXQJX37DD/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2MXQJX37DD.md",
  "msc": null,
  "name": "Theorems in logic",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2MX/2MXQJX37DD.md",
  "status": null,
  "tag": "2MXQJX37DD",
  "uri": "m2://2MXQJX37DD",
  "url": "https://math2.tamnd.com/wiki/theorems-in-logic/",
  "writing": {
    "tag": "2MXQJX37DD",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}