Category:Order theory
![]() | Computing portal |
Here is a list of articles in the Order theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
Order theory is a branch of mathematics that studies various ways of formalizing the intuitive notion of a mathematical ordering.
Subcategories
This category has the following 6 subcategories, out of 6 total.
C
L
O
S
Pages in category "Order theory"
The following 170 pages are in this category, out of 170 total.
- Glossary of order theory (computing)
- List of order theory topics (computing)
- Order theory (computing)
A
- Alexandrov topology (computing)
- Amoeba order (computing)
- Antichain (computing)
- Archimedean ordered vector space (computing)
- Aronszajn line (computing)
- Ascending chain condition (computing)
- Atom (order theory) (computing)
B
- Banach lattice (computing)
- Better-quasi-ordering (computing)
- Betweenness (computing)
- Boolean differential calculus (computing)
- Boolean prime ideal theorem (computing)
- Bound graph (computing)
- Bounded complete poset (computing)
- Bounded set (computing)
- Bourbaki–Witt theorem (computing)
- Bruhat order (computing)
C
- Cantor–Bernstein theorem (computing)
- Causal sets (physics)
- Centered set (computing)
- Chain-complete partial order (computing)
- Closure operator (computing)
- Cofinal (mathematics) (computing)
- Cofinality (computing)
- Compact element (computing)
- Comparability (computing)
- Comparability graph (computing)
- Complete Boolean algebra (computing)
- Complete Heyting algebra (computing)
- Complete partial order (computing)
- Completely distributive lattice (computing)
- Completeness (order theory) (computing)
- Containment order (computing)
- Countable chain condition (computing)
- Countryman line (computing)
- Covering relation (computing)
- Critical pair (order theory) (computing)
- Cyclic order (computing)
D
- Dedekind cut (computing)
- Dedekind–MacNeille completion (computing)
- Dehornoy order (computing)
- Dense order (computing)
- Deviation of a poset (computing)
- Dilworth's theorem (computing)
- Directed set (computing)
- Disjunction property of Wallman (computing)
- Distributive polytope (computing)
- Distributivity (order theory) (computing)
- Duality (order theory) (computing)
- Dushnik–Miller theorem (computing)
E
- Embedding (computing)
- Encompassment ordering (computing)
- Erdős–Dushnik–Miller theorem (computing)
- Η set (computing)
F
- Fence (mathematics) (computing)
- Filter (mathematics) (computing)
- Fréchet filter (computing)
- Friedman's SSCG function (computing)
- Frink ideal (computing)
G
- Galois connection (computing)
- Graded poset (computing)
- Greatest and least elements (computing)
- Greatest element and least element (computing)
- Greedoid (computing)
H
- Hasse diagram (computing)
- Hausdorff gap (computing)
- Hausdorff maximal principle (computing)
- Higman's lemma (computing)
I
- Ideal (order theory) (computing)
- Incidence algebra (computing)
- Incidence poset (computing)
- Inclusion order (computing)
- Infimum and supremum (computing)
- Infinite descending chain (computing)
- Infinite divisibility (philosophy)
- Interval (mathematics) (computing)
- Interval order (computing)
- Inversion (discrete mathematics) (computing)
J
- Join and meet (computing)
K
- Kernel operator (computing)
- Kleene fixed-point theorem (computing)
- Kleene–Brouwer order (computing)
- Knaster's condition (computing)
- Knaster–Tarski theorem (computing)
- Kruskal's tree theorem (computing)
L
- Laver's theorem (computing)
- Least fixed point (computing)
- Least-upper-bound property (computing)
- Lexicographical order (computing)
- Limit-preserving function (order theory) (computing)
- Linear continuum (computing)
- Linear extension (computing)
- Linked set (computing)
- Locally finite poset (computing)
- Lubell–Yamamoto–Meshalkin inequality (computing)
M
- Majorization (computing)
- Maximal and minimal elements (computing)
- Mirsky's theorem (computing)
- Möbius inversion formula (computing)
- Monomial order (computing)
- Monotonic function (computing)
- Multitree (computing)
N
- Nucleus (order theory) (computing)
O
- Order convergence (computing)
- Order dimension (computing)
- Order embedding (computing)
- Order isomorphism (computing)
- Order polynomial (computing)
- Order polytope (computing)
- List of order structures in mathematics (computing)
- Order topology (computing)
- Order topology (functional analysis) (computing)
- Ordered geometry (computing)
- Ordered pair (computing)
- Ordered topological vector space (computing)
- Ordinal optimization (computing)
- Ordinal sum (computing)
P
- Pantachy (computing)
- Partial cyclic order (computing)
- Partially ordered group (computing)
- Partially ordered set (computing)
- Pasch's theorem (computing)
- Path ordering (term rewriting) (computing)
- Peck poset (computing)
- Pointwise order (computing)
- Poset topology (computing)
- Prefix order (computing)
- Preorder (computing)
- Preordered class (computing)
- Prewellordering (computing)
- Prime (order theory) (computing)
- Product order (computing)
- Projection (order theory) (computing)
- Pseudo-order (computing)
- Pseudoideal (computing)
Q
- Quantale (computing)
R
- Ranked poset (computing)
- Residuated mapping (computing)
- Rewrite order (computing)
S
- Scattered order (computing)
- Schnyder's theorem (computing)
- Schur–Horn theorem (computing)
- Scott continuity (computing)
- Scott domain (computing)
- Semiorder (computing)
- Separation relation (computing)
- Series-parallel partial order (computing)
- Shortlex order (computing)
- Solid set (computing)
- Specialization (pre)order (computing)
- Sperner property of a partially ordered set (computing)
- Stone duality (computing)
- Strong antichain (computing)
- Supermodular function (computing)
- Suslin's problem (computing)
T
- Teichmüller–Tukey lemma (computing)
- Topkis's theorem (computing)
- Total order (computing)
- Trichotomy (mathematics) (computing)
U
- Ultrafilter (computing)
- Upper and lower bounds (computing)
- Upper set (computing)
- Upper topology (computing)
W
- Weak ordering (computing)
- Well-order (computing)
- Well-quasi-ordering (computing)
Z
- Zorn's lemma (computing)