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...
7 KB (816 words) - 12:57, 11 March 2023
equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras...
40 KB (5,665 words) - 11:17, 1 November 2024
Here: p. 35 Brian A. Davey and Hilary Ann Priestley (1990). Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press...
21 KB (3,093 words) - 12:07, 5 October 2024
Partial Order Ideal, Wolfram MathWorld, 2002, retrieved 2023-02-26 George M. Bergman (2008), "On lattices and their ideal lattices, and posets and their...
13 KB (1,766 words) - 09:56, 30 January 2024
of coatoms. Davey, B. A.; Priestley, H. A. (2002), Introduction to Lattices and Order, Cambridge University Press, ISBN 978-0-521-78451-1 "Atom". PlanetMath...
3 KB (361 words) - 01:40, 17 June 2024
ISBN 978-0-387-90578-5. Davey, B. A.; Priestley, H. A. (2002). Introduction to Lattices and Order (2nd ed.). Cambridge University Press. ISBN 0-521-78451-4...
31 KB (4,508 words) - 03:55, 24 August 2024
second may hold; see the N5 lattice for an example. Davey, B.A.; Priestley, H. A. (2002), Introduction to Lattices and Order (2nd ed.), Cambridge University...
4 KB (457 words) - 00:47, 21 September 2023
3210040138, MR 0039776. Davey, B.A.; Priestley, H. A. (2002). Introduction to Lattices and Order (Second ed.). Cambridge University Press. ISBN 0-521-78451-4...
11 KB (1,428 words) - 09:22, 13 November 2024
Semilattice (redirect from Upper semi-lattice)
Springer 1976, p. 57 Davey, B. A.; Priestley, H. A. (2002). Introduction to Lattices and Order (second ed.). Cambridge University Press. ISBN 0-521-78451-4...
18 KB (2,397 words) - 11:30, 27 March 2024
\,\wedge .\,} Davey, B.A.; Priestley, H.A. (2002). Introduction to Lattices and Order (2nd ed.). Cambridge: Cambridge University Press. ISBN 0-521-78451-4...
13 KB (2,262 words) - 18:44, 27 December 2023
Introduction to Lattices and Order, Cambridge University Press, p. 37, ISBN 978-0-521-78451-1 Adhikari, M. R.; Adhikari, A. (2003), Groups, Rings And...
2 KB (176 words) - 07:13, 16 May 2024
Partially ordered set (redirect from Partial order)
hdl:10338.dmlcz/101379. Davey, B. A.; Priestley, H. A. (2002). Introduction to Lattices and Order (2nd ed.). New York: Cambridge University Press. ISBN 978-0-521-78451-1...
40 KB (5,378 words) - 19:57, 4 November 2024
Inequation (redirect from Not equal to)
2019-12-03. Brian A. Davey; Hilary Ann Priestley (1990). Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press...
5 KB (752 words) - 19:23, 13 June 2024
Boolean algebra (structure) (redirect from Boolean lattice)
axioms is called an orthocomplemented lattice. Orthocomplemented lattices arise naturally in quantum logic as lattices of closed linear subspaces for separable...
49 KB (3,356 words) - 02:25, 17 September 2024
A.; Priestley, H. A. (2002), "Maps between ordered sets", Introduction to Lattices and Order (2nd ed.), New York: Cambridge University Press, pp. 23–24...
6 KB (817 words) - 17:19, 24 September 2024
Absorption law (category Lattice theory)
distributivity, identity, and boundary laws. Brian A. Davey; Hilary Ann Priestley (2002). Introduction to Lattices and Order (2nd ed.). Cambridge University...
3 KB (271 words) - 15:48, 10 October 2023
Disjunctive normal form (section Conversion to DNF)
ISBN 9780521424264. Davey, B.A.; Priestley, H.A. (1990). Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press...
17 KB (2,077 words) - 11:39, 12 November 2024
(2009). Introduction to Mathematics of Satisfiability. CRC Press. p. 17. ISBN 978-1-4398-0174-1. Davey & Priestley, Introduction to Lattices and Order (Second...
5 KB (644 words) - 00:41, 28 April 2024
Hilary Priestley (category Lattice theorists)
(2002). Introduction to Lattices and Order (2nd ed.). Cambridge University Press. ISBN 9780521784511. Priestley, Hilary A. (1997). Introduction to Integration...
4 KB (282 words) - 12:55, 17 September 2024
Galois connection (category Order theory)
books and survey articles include Galois connections using the monotone definition: Brian A. Davey and Hilary A. Priestley: Introduction to Lattices and Order...
34 KB (4,173 words) - 21:35, 8 September 2024
are a special case of orthocomplemented lattices, which in turn are a special case of complemented lattices (with extra structure). The ortholattices...
8 KB (876 words) - 19:48, 13 September 2024
lattices above. Glossary of order theory Distributive lattice B. A. Davey and H. A. Priestley, Introduction to Lattices and Order 2nd Edition, Cambridge University...
5 KB (649 words) - 22:30, 2 June 2024
collections of sets for which the lattice operations can be given by set union and intersection. Indeed, these lattices of sets describe the scenery completely:...
17 KB (2,053 words) - 09:41, 6 November 2024
Formal concept analysis (redirect from Concept lattice)
called a weakly dicomplemented lattice. Weakly dicomplemented lattices generalize distributive orthocomplemented lattices, i.e. Boolean algebras. Temporal...
47 KB (5,372 words) - 19:41, 13 May 2024
Bravais lattices are often considered equivalent if they have isomorphic symmetry groups. In this sense, there are 5 possible Bravais lattices in 2-dimensional...
21 KB (2,438 words) - 01:16, 19 August 2024
completeness properties one obtains continuous lattices and algebraic lattices, which are just complete lattices with the respective properties. For the algebraic...
19 KB (2,689 words) - 18:02, 16 October 2024
and H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 2002; see "Notation Index", p. 286. Gary Hardegree, Introduction to...
19 KB (2,501 words) - 17:52, 4 November 2024
Dedekind–MacNeille completion (category Order theory)
Hilary A. (2002), "7.38 The Dedekind–MacNeille completion", Introduction to Lattices and Order (2nd ed.), Cambridge University Press, p. 166, ISBN 978-0-521-78451-1...
22 KB (2,726 words) - 08:00, 11 January 2024
Knaster–Tarski theorem (category Order theory)
Davis: If every order-preserving function f : L → L on a lattice L has a fixed point, then L is a complete lattice. Since complete lattices cannot be empty...
19 KB (2,415 words) - 11:14, 30 October 2024
Filter (mathematics) (category Order theory)
associated partial ordering. Historically, filters generalized to order-theoretic lattices before arbitrary partial orders. In the case of lattices, downward direction...
23 KB (2,819 words) - 18:40, 14 October 2024