Free Lattices Generated by Partially Ordered Sets and Preserving Bounds
- 1 January 1964
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 16, 136-148
- https://doi.org/10.4153/cjm-1964-013-5
Abstract
A construction of the free lattice generated by a partially ordered set P and preserving every least upper bound (lub) and greatest lower bound (glb) of pairs of elements existing in P has been given by Dilworth (2, pp. 124-129) and, when P is finite, by Gluhov (5).The results presented here construct the free lattice FL generated by the partially ordered set P and preserving(1) the ordering of P(2) those lub's of a family of finite subsets of P which possess lub's in PKeywords
This publication has 5 references indexed in Scilit:
- Decomposition theory for lattices without chain conditionsTransactions of the American Mathematical Society, 1960
- Completely free lattices generated by partially ordered setsTransactions of the American Mathematical Society, 1956
- The Word Problem for Abstract AlgebrasJournal of the London Mathematical Society, 1951
- Lattices with unique complementsTransactions of the American Mathematical Society, 1945
- Free LatticesAnnals of Mathematics, 1941