Completeness is a quality of proof procedures. A complete procedure is one which can derive anything which follows logically.
Fitting, Melvin. First-Order Logic and Automated Theorem Proving. Springer, 1990.
Copyright © 2014 Barry Watson. All rights reserved.