{
  "id": "soundness-logic",
  "title": "Soundness (Logic)",
  "lang": "en",
  "source_lang": "en",
  "summary": "Soundness is the property that a proof system derives only conclusions warranted by its semantics; a sound argument is valid and has true premises.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Logical soundness",
    "Soundness of a deductive system"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/soundness-logic/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/soundness-logic/",
      "json": "https://aiwiki.page/zh/soundness-logic.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Soundness in logic is the property that formal derivations preserve semantic correctness: whenever a conclusion can be proved from given premises, it is true in every interpretation in which those premises are true. Soundness connects the syntactic rules of a formal system with the meanings assigned to its expressions. In a related but distinct usage, an individual argument is called sound when it is logically valid and all its premises are true."
    },
    {
      "heading": "Formal definition",
      "text": "Let \\(\\Gamma\\) be a set of premises and \\(\\varphi\\) a formula. Write\n\n\\[\\Gamma\\vdash\\varphi\\]\n\nto mean that there is a formal proof of \\(\\varphi\\) from \\(\\Gamma\\) in a specified deductive system. Write\n\n\\[\\Gamma\\models\\varphi\\]\n\nto mean that \\(\\varphi\\) is a semantic consequence of \\(\\Gamma\\): every interpretation satisfying all formulas in \\(\\Gamma\\) also satisfies \\(\\varphi\\).\n\nThe deductive system is sound for its semantics if, for every appropriate \\(\\Gamma\\) and \\(\\varphi\\),\n\n\\[\\Gamma\\vdash\\varphi \\quad\\Longrightarrow\\quad \\Gamma\\models\\varphi.\\]\n\nThus, syntactic derivability never exceeds semantic consequence. A sound system cannot derive a conclusion that is false in an interpretation satisfying its premises.\n\nFor propositional logic, interpretations are assignments of truth values to propositional variables. For first-order logic, interpretations are structures specifying a domain and interpretations of the nonlogical symbols. When formulas contain free variables, satisfaction also depends on an assignment of domain elements to those variables.\n\nSoundness is therefore always relative to a specified semantics. A collection of inference rules is not sound or unsound independently of how its formulas and consequence relation are interpreted.\n\nWeak and strong soundness\n\nThe premise-sensitive condition above is often called strong soundness. Weak soundness concerns only theorems, which are formulas derivable without premises:\n\n\\[\\vdash\\varphi \\quad\\Longrightarrow\\quad \\models\\varphi.\\]\n\nHere \\(\\models\\varphi\\) means that \\(\\varphi\\) is logically valid: it is true in every interpretation admitted by the semantics.\n\nStrong soundness implies weak soundness by taking \\(\\Gamma\\) to be empty. The converse is not automatic for an arbitrary proof system, although standard systems often provide ways to connect the two. Terminology varies, and many presentations simply use “soundness” for the premise-sensitive result."
    },
    {
      "heading": "Sound arguments and sound proof systems",
      "text": "The soundness of an argument must be distinguished from the soundness of an entire deductive system.\n\nAn argument is valid if there is no interpretation in which all its premises are true and its conclusion is false. It is sound if it is valid and its premises are in fact true.\n\nFor example:\n\n- Every integer divisible by \\(4\\) is even.\n- \\(12\\) is divisible by \\(4\\).\n- Therefore, \\(12\\) is even.\n\nThis is a sound argument under the usual interpretation of integers and divisibility.\n\nBy contrast:\n\n- Every prime number is odd.\n- \\(3\\) is prime.\n- Therefore, \\(3\\) is odd.\n\nThe second argument has a valid form, but it is not sound because its first premise is false: \\(2\\) is a prime number that is not odd. Its conclusion nevertheless happens to be true.\n\nA sound deductive system does not guarantee the actual truth of arbitrary premises supplied to it. It guarantees that its derivations do not introduce a false conclusion when the premises are true. Consequently, a false premise used in an otherwise correct proof does not show that the underlying proof system is unsound."
    },
    {
      "heading": "How soundness is proved",
      "text": "A soundness theorem is proved in a metatheory: a mathematical setting in which formulas, derivations, and interpretations can be studied as objects. It is a central result connecting proof theory with model theory.\n\nFor many proof systems, the proof has two main components:\n\n- Show that every logical axiom or axiom instance is valid.\n- Show that each rule of inference preserves the relevant semantic consequence relation.\n\nAn application of mathematical induction to the length or structure of a derivation then establishes soundness for all derivations.\n\nExample: modus ponens\n\nThe rule of modus ponens is\n\n\\[\\frac{A\\qquad A\\to B}{B}.\\]\n\nUnder classical semantics, if \\(A\\) and \\(A\\to B\\) are both true in an interpretation, then \\(B\\) must be true in that interpretation. Thus, if both premises are semantic consequences of \\(\\Gamma\\), so is \\(B\\).\n\nA proof system consisting of valid logical axioms and sound rules such as modus ponens can therefore be shown sound by checking every line of a proof.\n\nAssumptions, discharge, and side conditions\n\nIn natural deduction, some rules discharge assumptions. Their soundness must be formulated in terms of the relationship between open assumptions and conclusions, rather than simply as truth preservation between displayed formulas.\n\nFor example, implication introduction moves from a derivation of \\(B\\) under an additional assumption \\(A\\) to a derivation of \\(A\\to B\\) with that assumption discharged.\n\nQuantifier rules require particular care. A standard universal-introduction rule permits an inference of the form\n\n\\[\\frac{\\Gamma\\vdash A(x)} {\\Gamma\\vdash\\forall x\\,A(x)}\\]\n\nonly when \\(x\\) is not free in any undischarged assumption in \\(\\Gamma\\). Without this restriction, one could move illegitimately from a premise \\(P(x)\\) to \\(\\forall x\\,P(x)\\): the fact that one assigned object has a property does not imply that every object has it.\n\nComparable soundness proofs for sequent calculi proceed by induction on derivation trees. The details depend on the meanings of sequents and on the structural and logical rules available."
    },
    {
      "heading": "Relation to completeness",
      "text": "Soundness and completeness concern opposite directions of the connection between proof and semantics:\n\nProperty | Formal condition | Meaning\nSoundness | \\(\\Gamma\\vdash\\varphi\\Rightarrow\\Gamma\\models\\varphi\\) | Everything derivable is semantically warranted.\nCompleteness | \\(\\Gamma\\models\\varphi\\Rightarrow\\Gamma\\vdash\\varphi\\) | Every semantic consequence is derivable.\n\nWhen both hold,\n\n\\[\\Gamma\\vdash\\varphi \\quad\\Longleftrightarrow\\quad \\Gamma\\models\\varphi.\\]\n\nStandard classical propositional calculi are sound and complete for truth-value semantics. Standard classical first-order calculi are sound and complete for ordinary first-order semantics; the completeness direction is established by Gödel’s completeness theorem, first proved in 1929 and published in 1930.\n\nA system may be sound without being complete. For example, a propositional calculus with no axioms and no rules beyond allowing premises derives only formulas already among its premises. It is sound, but it cannot prove even elementary valid formulas from no premises.\n\nSoundness and completeness also depend on the chosen class of interpretations. The same calculus may have different properties when evaluated against different semantics."
    },
    {
      "heading": "Relation to consistency and satisfiability",
      "text": "A theory is syntactically consistent, in a common classical formulation, if it does not derive a contradiction. It is satisfiable if it has at least one model.\n\nIf a sound proof system is used and a theory \\(T\\) has a model, then \\(T\\) is consistent. Otherwise, soundness would require that model to satisfy a contradiction.\n\nHowever, the soundness of the proof system does not imply that every possible set of premises is consistent. In classical logic, a contradictory set of premises has no model. Consequently,\n\n\\[\\Gamma\\models\\varphi\\]\n\nholds for every \\(\\varphi\\) when \\(\\Gamma\\) is unsatisfiable: there is no interpretation satisfying \\(\\Gamma\\) that could serve as a counterexample. This is why deriving arbitrary conclusions from contradictory premises does not, by itself, violate classical soundness.\n\nConsistency is also weaker than truth in an intended interpretation. A theory may have models while containing statements false in the particular structure it was intended to describe.\n\nSoundness of a theory in an intended model\n\nWhen a theory is called sound, the intended claim is often that all its theorems are true in a particular intended structure.\n\nFor an arithmetic theory \\(T\\), soundness in the standard structure \\(\\mathbb N\\) means\n\n\\[T\\vdash\\varphi \\quad\\Longrightarrow\\quad \\mathbb N\\models\\varphi\\]\n\nfor every sentence \\(\\varphi\\).\n\nThis requires more than the soundness of first-order logic. Logical soundness guarantees truth in every model of \\(T\\); it does not independently establish that the standard natural numbers form such a model. If the axioms of \\(T\\) are true in \\(\\mathbb N\\), logical soundness ensures that its theorems are true there as well."
    },
    {
      "heading": "Soundness and incompleteness",
      "text": "Gödel’s incompleteness theorems do not contradict the soundness or completeness of first-order logic. The results concern different distinctions:\n\n- Logical completeness concerns truth in every model of a set of premises.\n- Arithmetical completeness would require a theory to decide every sentence in its language.\n- Soundness in standard arithmetic concerns truth in one particular structure, \\(\\mathbb N\\).\n\nA consistent, effectively axiomatized theory sufficiently strong for arithmetic cannot decide every arithmetical sentence. If such a theory is sound in \\(\\mathbb N\\), it therefore leaves some truths about \\(\\mathbb N\\) unproved. This is compatible with first-order completeness: a sentence true in \\(\\mathbb N\\) need not be true in every model of the theory.\n\nSoundness proofs are also relative to their metatheoretic assumptions. For sufficiently strong arithmetical theories satisfying the usual hypotheses of the second incompleteness theorem, the theory cannot prove its own standard consistency statement if it is consistent. A suitably formulated internal soundness assertion would imply consistency, so it faces a corresponding limitation."
    },
    {
      "heading": "Other logics and computational uses",
      "text": "Soundness is not restricted to classical truth-value semantics. Intuitionistic logic has soundness results for suitable algebraic and relational semantics. A rule valid under classical semantics may fail under those semantics; the law of excluded middle, for example, is not generally valid intuitionistically.\n\nIn formal verification, soundness establishes that properties derived by a verification calculus hold under the mathematical semantics assigned to a program or system. This remains distinct from whether the mathematical model accurately represents a physical implementation.\n\nFor an automated theorem prover, soundness means that every claimed theorem is justified by the relevant logic. Completeness is a separate issue: a sound prover may fail to find some proofs. A sound and complete first-order calculus also does not provide an algorithm that always terminates with the correct answer to every first-order validity question. Soundness controls correctness of conclusions, not termination or computational cost."
    }
  ],
  "links": [
    "logic",
    "formal-system",
    "formal-proof",
    "logical-consequence",
    "propositional-logic",
    "first-order-logic",
    "logical-validity",
    "integer",
    "proof-theory",
    "model-theory",
    "axiom",
    "inference-rule",
    "mathematical-induction",
    "modus-ponens",
    "natural-deduction",
    "sequent-calculus",
    "godels-completeness-theorem",
    "godels-incompleteness-theorems",
    "intuitionistic-logic",
    "law-of-excluded-middle",
    "formal-verification"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}