# Definition:Complete

Jump to navigation
Jump to search

## Disambiguation

This page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article.

**Complete** may refer to:

- Order Theory:
- Complete Ordered Set: an ordered set whose subsets all admit both a supremum and an infimum

- (also known as a Complete Lattice)

- Dedekind Complete Set an ordered set whose non-empty subsets that are bounded above all admit a supremum
- Chain Complete Set: an ordered set in which every chain has an upper bound

- (also known as an inductive ordered set).

- Lattice Theory:
- Complete Lattice: a lattice whose subsets all admit both an supremum and an infimum

- (also known as a Complete Ordered Set)

- Logic:
- Functionally Complete: a set of truth functions $S$ such that all possible truth functions are definable from $S$
- Complete Proof System: a proof system for which every tautology is a theorem
- Complete Theory: an $\LL$-theory in which, for every $\LL$-sentence $\phi$, either $T \models \phi$ or $T \models \neg \phi$, where $T \models \phi$ denotes semantic entailment.

- Graph Theory:
- Complete Graph: a simple graph such that every vertex is adjacent to every other vertex
- Complete Bipartite Graph: a bipartite graph $G = \struct {A \mid B, E}$ in which every vertex in $A$ is adjacent to every vertex in $B$.

This list is incomplete.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by expanding it.To discuss this page in more detail, feel free to use the talk page.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |