Completeness

In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields.

Logical completeness
In logic, completeness is the converse of soundness for formal systems. Whereas soundness is when a formal system is such that all theorems are tautologies, completeness is when all tautologies are theorems. Kurt Gödel, Leon Henkin, and Post all published proofs of completeness. A system is consistent if a proof never exists for both P and not P. Gödel's incompleteness theorem says that no system as powerful as the Peano axioms can be both consistent and complete.


 * A language is expressively complete if it can express the subject matter for which it is intended.


 * A formal system is complete with respect to a property iff every sentence that has the property is a theorem.


 * A formal system is functionally complete if it has adequate logical connectives to express all of the theorems of the language.


 * A formal system is strongly complete or complete in the strong sense iff no sentence which is not a theorem can become a theorem through the addition of a new basic rule (a rule of inference or an axiom) without the system becoming unsound. First order sentential calculus is strongly complete.


 * A formal system is maximally complete iff every sentence is either a theorem or the negation of a theorem.


 * A formal system is extremely complete or complete in the extreme sense iff every sentence is a theorem.


 * A formal system is deductively complete iff if there are no formulas constructed on the base of the system (the axioms) which are derivable by the rules of the system as theorems and which are not tautologies.


 * In one sense, a formal system S is syntactically complete or has syntactic completeness iff for each formula A of the language of the system either A or ~A is a theorem of S. This is also called negation completeness. In another sense, a formal system is syntactically complete iff no unprovable schema can be added to it as an axiom schema without inconsistency. Truth-functional propositional logic is semantically, and syntactically complete. First order predicate logic is semantically complete, but not syntactically or negation complete.


 * An effective method (or decision procedure) is complete if, the method always produces the correct answer to a decision problem.

Mathematical completeness
In mathematics, the notion of completeness is related to completeness in logic. "Complete" here is just a term that takes on specific meanings in specific situations, and not every situation in which a type of "completion" occurs is called a "completion". See, for example, algebraically closed field or compactification.


 * In mathematical logic, a theory is complete, if it contains either $$\scriptstyle S$$ or $$\scriptstyle \neg S$$ for every sentence $$\scriptstyle S$$ in the language. The calculus is complete, if the same holds for the empty set of premises $$\scriptstyle G\,=\,\varnothing$$ (i.e., if all tautologies of the logic can be proven).
 * In mathematical logic, a formal calculus for a logic L is strongly complete with respect to a certain semantics of L, if every statement P that follows semantically from a set of premises G can be derived syntactically from these premises within the calculus. Formally, $$\scriptstyle G\ \models\ P $$ implies $$\scriptstyle G\ \vdash\ P $$.


 * A metric space (or uniform space) is complete if every Cauchy sequence in it converges. See complete space.


 * In functional analysis, a subset S of a topological vector space V is complete if its span is dense in V. If V is separable, it follows that any vector in V can be written as a (possibly infinite) linear combination of vectors from S. In the particular case of Hilbert spaces (or more generally, inner product spaces), an orthonormal basis is a set that is both complete and orthonormal.


 * A measure space is complete if every subset of every null set is measurable. See complete measure.


 * In commutative algebra, a commutative ring can be completed at an ideal (in the topology defined by the powers of the ideal). See Completion (ring theory).


 * More generally, any topological group can be completed at a decreasing sequence of open subgroups.


 * In auditing, completeness is one of the financial statement assertions that have to be ensured. For example, auditing classes of transactions. Rental expense which includes 12-month or 52-week payments should be all booked according to the terms agreed in the tenancy agreement.


 * In statistics, a statistic is called complete if it does not allow an unbiased estimator of zero. See completeness (statistics).


 * In graph theory, a complete graph is an undirected graph in which every pair of vertices has exactly one edge connecting them.


 * In software testing, completeness has for goal the functional verification of call graph (between software item) and control graph (inside each software item).


 * In category theory, a category C is complete if every functor from a small category to C has a limit; it is cocomplete if every such functor has a colimit. For more information, see the given article on limits in category theory.


 * In order theory and related fields such as lattice and domain theory, completeness generally refers to the existence of certain suprema or infima of some partially ordered set. Notable special usages of the term include the concepts of complete Boolean algebra, complete lattice, and complete partial order (cpo). Furthermore, an ordered field is complete if every non-empty subset of it that has an upper bound within the field has a least upper bound within the field, which should be compared to the (slightly different) order-theoretical notion of bounded completeness. Up to isomorphism there is only one complete ordered field: the field of real numbers (but note that this complete ordered field, which is also a lattice, is not a complete lattice).


 * In computational complexity theory, a problem P is complete for a complexity class C, under a given type of reduction, if P is in C, and every problem in C reduces to P using that reduction. For example, each problem in the class NP-complete is complete for the class NP, under polynomial-time, many-one reduction.


 * In computing, a data-entry field can autocomplete the entered data based on the prefix typed into the field; that capability is known as autocompletion.

Economics & Finance

 * Complete market

Vollkommen Complétude Potpunost (razdvojba) Completude (lógica) 完備性