A metatheorem that guarantees every formula provable in a given formal deductive system is also semantically valid in the intended class of models; syntactic derivability implies model-theoretic truth.

Principle

Proofs preserve truth: if a sentence is derivable by the system's proof rules, then it holds in every model of the system's semantics.

Demonstration

In propositional logic one shows that whenever ⊢ φ (φ is derivable from the axioms and rules) then ⊨ φ (φ is true under every truth-assignment/model), by checking that every axiom is valid and that rules of inference preserve validity.

Misapplication

Assuming soundness for a system whose inference rules permit invalid steps (for example, an unrestricted rule that derives arbitrary formulas) or treating soundness as evidence of completeness for that system.

Consequence

Reliable trust in proofs: a proven theorem cannot be semantically false relative to the intended semantics, enabling the use of syntactic proof search to establish semantic truths.

Reversal

Completeness reverses the relation by asserting that semantic entailment implies syntactic provability (in the systems where completeness holds).

Boundary

Applies only relative to a specified proof system and a specified semantics; soundness can fail if proof rules, axioms, or intended models are changed; it does not by itself say which true sentences are provable.

Semantic Tension

Tension with completeness and with informal notions of truth: soundness secures one direction (derivation→validity) while leaving open whether all validities are derivable.

Synthesis

Soundness is the formal assurance that the deductive machinery does not produce semantic falsehoods: it links syntactic derivations to semantic validity for the chosen system and interpretation, while dependence on the particular rules and models marks its scope and limits.