<*logic*> An inference system A is complete with respect to
another system B if A can reach every conclusion which is true
in B. The dual to completeness is soundness.

Last updated: 1998-07-05

Try this search on Wikipedia, OneLook, Google

**Nearby terms:**
complementary nondeterministic polynomial « complete « complete graph « **complete inference system** » complete lattice » complete metric space » completeness

Loading

Copyright Denis Howe 1985