|
|
|
|
sound, complete
|
(Definition)
|
|
|
If $Th$ and $Pr$ are two sets of facts (in particular, a theory of some language and the set of things provable by some method) we say $Pr$ is sound for $Th$ if $Pr\subseteq Th$ 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 $Th$ .
If $Th\subseteq Pr$ we say $Pr$ is complete for $Th$ 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 $Th$ can be proven.
|
"sound, complete" is owned by Henry.
|
|
(view preamble | get metadata)
| Also defines: |
sound, complete |
|
|
Cross-references: clear, proofs, language, theory
There are 66 references to this entry.
This is version 4 of sound, complete, born on 2002-09-07, modified 2002-09-08.
Object id is 3445, canonical name is CompleteSound.
Accessed 12107 times total.
Classification:
| AMS MSC: | 03F03 (Mathematical logic and foundations :: Proof theory and constructive mathematics :: Proof theory, general) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
