Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

complete inference system

You are here: irt.org | FOLDOC | complete inference system

<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.


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

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb