|This article needs additional citations for verification. (January 2014)|
||It has been suggested that this article be split into multiple articles accessible from a disambiguation page. (May 2013)|
|Look up completeness in Wiktionary, the free dictionary.|
In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields.
In logic, semantic completeness is the converse of soundness for formal systems. A formal system is "semantically complete" when all its tautologies are theorems, whereas a formal system is "sound" when all theorems are tautologies (that is, they are semantically valid formulas: formulas that are true under every interpretation of the language of the system that is consistent with the rules of the system). Kurt Gödel, Leon Henkin, and Emil Post all published proofs of completeness. (See History of the Church–Turing thesis.) A formal system is consistent if for all formulas φ of the system, the formulas φ and ¬φ (the negation of φ) are not both theorems of the system (that is, they cannot be both proved with the rules of the system).
- A formal system S is semantically complete or simply complete, if every tautology of S is a theorem of S. That is, .1
- A formal system S is strongly complete or complete in the strong sense if for every set of premises Γ, any formula which semantically follows from Γ is derivable from Γ. That is, .
- A formal system S is syntactically complete or deductively complete or maximally complete or simply complete if for each sentence (closed formula) φ of the language of the system either φ or ¬φ is a theorem of S. This is also called negation completeness. In another sense, a formal system is syntactically complete if and only if no unprovable axiom can be added to it as an axiom without introducing an inconsistency. Truth-functional propositional logic and first-order predicate logic are semantically complete, but not syntactically complete (for example, the propositional logic statement consisting of a single propositional variable A is not a theorem, and neither is its negation, but these are not tautologies). Gödel's incompleteness theorem shows that any recursive system that is sufficiently powerful, such as Peano arithmetic, cannot be both consistent and syntactically complete.
- A system of logical connectives is functionally complete if and only if it can express all propositional functions.
- A language is expressively complete if it can express the subject matter for which it is intended.citation needed
- A formal system is complete with respect to a property if and only if every sentence that has the property is a theorem.citation needed
In mathematics, "complete" is 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.
- The completeness of the real numbers is one of the defining properties of the real number system. It may be described equivalently as either the completeness of R as metric space or as a partially ordered set (see below).
- A uniform space is complete if every Cauchy net in it converges (or equivalently every Cauchy filter in it converges).
- In functional analysis, a subset S of a topological vector space V is complete if its span is dense in V. 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.
- 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 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 category theory, a category C is complete if every diagram from a small category to C has a limit; it is cocomplete if every such functor has a colimit.
- 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 algebraic geometry, an algebraic variety is complete if it satisfies an analog of compactness. See complete algebraic variety.
- In quantum mechanics, a complete set of commuting operators (or CSCO) is one whose eigenvalues are sufficient to specify the physical state of a system.
- In algorithms, the notion of completeness refers to the ability of the algorithm to find a solution if one exists, and if not, to report that no solution is possible.
- In data structures, a tree is said to be complete when every row is full, except for perhaps the last one, which is filled from the left. An example of a complete tree is the heap data structure.
- 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.
- In software testing, completeness has for goal the functional verification of call graph (between software item) and control graph (inside each software item).
- The concept of completeness is found in knowledge base theory.
- Complete markets versus incomplete markets
- 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.
- Oil or gas well completion, the process of making a well ready for production.
- A complete flower is a flower with both male and female reproductive structures as well as petals and sepals. See Sexual reproduction in plants.
- Hunter, Geoffrey, Metalogic: An Introduction to the Metatheory of Standard First-Order Logic, University of California Pres, 1971