Soundness theorems are among the most fundamental results in mathematical logic. They are relative to a particular semantic theory for a formal logical language and a formal deductive system for that language. Soundness theorems come in two main varieties: weak and strong soundness. Mathematical logic is a discipline within mathematics, studying formal systems in relation to the way they encode intuitive concepts of proof and computation as part of the foundations of mathematics. ...

The weak soundness theorem for a deductive system is the result that any sentence that is provable in that deductive system is a true on all interpretations or models of the semantic theory for the language upon which that theory is based. In symbols, where S is the deductive system and L the language together with its semantic theory, and P a sentence of L: ⊢_S P, then also ⊨_L P

The strong soundness theorem for a deductive system is the result that any sentence P of the language upon which the deductive system is based that is derivable from a set of sentences Gama of that language is also a semantic consequence of that set Gama, in the sense that any model that makes all members of Gama true will also make P true. In symbols where Gama is a set of sentences of L: if Gama ⊢_S P, then also Gama ⊨_L P

"Strong" and "weak" make sense here, as strong soundness considers arbitrary sets of sentences, and the empty set of sentences that is relevant to weak soundness is one such set. For most, but not all, deductive systems of interest, both strong and weak soundness hold.

The converse of the soundness theorem is the semantic completeness theorem. In the strong form, it says for a deductive system and semantic theory that any sentence which is a semantic consequence of a set of sentences can be derived in the deduction system from that set. (In the important case of first-order the completeness theorem is often called Gödel's completeness theorem.) In symbols: Gama ⊨_L P, then also Gama ⊢_S P Gödels completeness theorem is a fundamental theorem in mathematical logic proved by Kurt Gödel in 1929. ...

Informally, the soundness theorem for a deductive system tells you that everything you can derive or prove with that deductive system is something you would want to be able to derive or prove. And thus, nothing that you would not want to derive can be derived. Hence, derivation can be trusted, with respect to the semantics. Completeness tells you that everything you would want to be able to derive or prove can be derived.

Gödel's first incompleteness theorem guarantees that for sufficiently expressive languages, there can be no deductive system that is complete with respect to a classical semantics upon which every sentence is either true or false. Thus, not all sound deductive systems are complete. In mathematical logic, Gödels incompleteness theorems are two celebrated theorems proven by Kurt Gödel in 1931. ...

However, a soundness theorem is generally considered a minimal requisite to have an interesting deductive system at all. This is because if a deductive system is unsound, that a sentence can be derived or proven in the deductive system does not tell you anything about the semantic properties of the sentence.