sound,, complete (original) (raw)

If T⁢h and P⁢r are two sets of facts (in particular, a theory of some language and the set of things provable by some method) we say P⁢r is sound for T⁢h if P⁢r⊆T⁢h. Typically we have a theory and set of rules for constructing proofs, and we say the set of rules are sound (which theory is intended is usually clear from context) since everything they prove is true (in T⁢h).

If T⁢h⊆P⁢r we say P⁢r is completePlanetmathPlanetmath for T⁢h. Again, we usually have a theory and a set of rules for constructing proofs, and say that the set of rules is complete since everything true (in T⁢h) can be proven.