sound,, complete∗
Henry†
2013-03-21 14:52:36
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 complete 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.
∗ hSoundCompletei created: h2013-03-21i by: hHenryi version: h33445i Privacy setting:
h1i hDefinitioni h03F03i
† This text is available under the Creative Commons Attribution/Share-Alike License 3.0.
You can reuse this document or portions thereof only if you do so under terms that are
compatible with the CC-BY-SA license.
1