Category:Definitions/Lattices (Order Theory)
Jump to navigation
Jump to search
This category contains definitions related to lattices in the context of order theory.
Related results can be found in Category:Lattices (Order Theory).
Let $\struct {S, \preceq}$ be an ordered set.
Suppose that $S$ admits all finite non-empty suprema and finite non-empty infima.
Denote with $\vee$ and $\wedge$ the join and meet operations on $S$, respectively.
Then the ordered structure $\struct {S, \vee, \wedge, \preceq}$ is called a lattice.
Subcategories
This category has only the following subcategory.
Pages in category "Definitions/Lattices (Order Theory)"
The following 11 pages are in this category, out of 11 total.
L
- Definition:Lattice (Order Theory)
- Definition:Lattice (Order Theory)/Also defined as
- Definition:Lattice (Order Theory)/Also denoted as
- Definition:Lattice (Order Theory)/Also known as
- Definition:Lattice (Order Theory)/Definition 1
- Definition:Lattice (Order Theory)/Definition 2
- Definition:Lattice (Order Theory)/Definition 3
- Definition:Lattice of Bounded Continuous Real-Valued Functions
- Definition:Lattice of Continuous Real-Valued Functions
- Definition:Lattice of Real-Valued Functions