Category:Order theory
From HandWiki
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.
Pages in category "Order theory"
The following 185 pages are in this category, out of 185 total.
A
B
C
- Cantor's isomorphism theorem
- Cantor–Bernstein theorem
- Physics:Causal sets
- Centered set
- Chain-complete partial order
- Closure operator
- Cofinal (mathematics)
- Cofinality
- Compact element
- Comparability
- Comparability graph
- Complete Boolean algebra
- Complete Heyting algebra
- Complete partial order
- Completely distributive lattice
- Completeness (order theory)
- Containment order
- Continuous poset
- Countable chain condition
- Countryman line
- Covering relation
- Critical pair (order theory)
- Cyclic order
D
F
G
I
K
L
M
O
P
- Pantachy
- Partial cyclic order
- Partially ordered group
- Partially ordered set
- Pasch's theorem
- Path ordering (term rewriting)
- Peck poset
- Pointwise order
- Poset topology
- Positive linear operator
- Prefix order
- Preorder
- Preordered class
- Prewellordering
- Prime (order theory)
- Product order
- Projection (order theory)
- Pseudo-order
- Pseudoideal
Q
S
- Scattered order
- Schnyder's theorem
- Schur–Horn theorem
- Scott continuity
- Scott domain
- Semiorder
- Separation relation
- Serial relation
- Series-parallel partial order
- Shortlex order
- Solid set
- Specialization (pre)order
- Sperner property of a partially ordered set
- Stone duality
- Strong antichain
- Supermodular function
- Suslin's problem
- Szpilrajn extension theorem
