Search results
Results from the WOW.Com Content Network
Introduction to Lattices and Order is a mathematical textbook on order theory by Brian A. Davey and Hilary Priestley. It was published by the Cambridge University Press in their Cambridge Mathematical Textbooks series in 1990, [ 1 ] [ 2 ] [ 3 ] with a second edition in 2002.
Distributivity is a basic concept that is treated in any textbook on lattice and order theory. See the literature given for the articles on order theory and lattice theory. More specific literature includes: G. N. Raney, Completely distributive complete lattices, Proceedings of the American Mathematical Society, 3: 677 - 680, 1952.
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet).
The Dedekind–MacNeille completion of S has the same order dimension as does S itself. [19] In the category of partially ordered sets and monotonic functions between partially ordered sets, the complete lattices form the injective objects for order-embeddings, and the Dedekind–MacNeille completion of S is the injective hull of S. [20]
Introduction to Lattices and Order (2nd ed.). Cambridge University Press. ISBN 0-521-78451-4. Taylor, Paul (1999), Practical foundations of mathematics, Cambridge Studies in Advanced Mathematics, vol. 59, Cambridge University Press, Cambridge, ISBN 0-521-63107-6, MR 1694820; Frenchman, Zack; Hart, James (2020), An Introduction to Order Theory, AMS
In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets.. Formally, a complete lattice L is said to be completely distributive if, for any doubly indexed family {x j,k | j in J, k in K j} of L, we have
Both order theory and universal algebra study them as a special class of lattices. Complete lattices must not be confused with complete partial orders (CPOs), a more general class of partially ordered sets. More specific complete lattices are complete Boolean algebras and complete Heyting algebras (locales). [citation needed]
A modular lattice of order dimension 2. As with all finite 2-dimensional lattices, its Hasse diagram is an st-planar graph. In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular law a ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b