Abstract
Lattices are (after chains) the most common ordered structures in mathematics. The reason probably is that the union and intersection of sets are the lattice operations “supremum” and “infimum” in the power set ordered by inclusion (see Example 3.21, part 5) and that many function spaces can be viewed as lattices (see Example 3.21, parts 6 and 7). Lattice theory is a well developed branch of mathematics. There are many excellent texts on lattice theory (see, e.g., [21, 54, 56, 98, 112]), so we will concentrate here only on some core topics and on the aspects that relate to unsolved problems and work presented in this text.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Not a relative of the author.
References
Birkhoff, G. (1967). Lattice theory (3rd ed.). Providence: AMS Colloquium Publications XXV.
Bordat, J. P. (1992). Sur l’algorithmique combinatoire d’ordres finis. Thèse de Docteur d’état, Université Montpellier II.
Crawley, P., & Dilworth, R. P. (1973). Algebraic theory of lattices. Englewood Cliffs: Prentice Hall.
Davey, B., & Priestley, H. (1990). Introduction to lattices and order. Cambridge: Cambridge University Press.
Davis, A. C. (1955). A characterization of complete lattices. Pacific Journal of Mathematics, 5, 311–319.
Duffus, D., Poguntke, W., & Rival, I. (1980). Retracts and the fixed point problem for finite partially ordered sets. Canadian Mathematical Bulletin, 23, 231–236.
Freese, R., Ježek, J., & Nation, J. (1995). Free lattices. Mathematical surveys and monographs (Vol. 42). Providence: American Mathematical Society
Grätzer, G. (1978). General lattice theory. Basel: Birkhäuser.
Knaster, B. (1928). Un théorème sur les fonctions d’ensembles. Annales de la Société Polonaise de Mathématique., 6, 133–134.
Liu, W.-P., & Wan, H. (1993). Automorphisms and isotone self-maps of ordered sets with top and bottom. Order, 10, 105–110.
Schröder, B. (2002). Examples on ordered set reconstruction. Order, 19, 283–294.
Schröder, B. (2003). On ordered sets with isomorphic marked maximal cards. Order, 20, 299–327.
Schröder, B. (2010). Fundamentals of mathematics – An introduction to proofs, logic, sets and numbers. Hoboken: Wiley.
Tarski, A. (1955). A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 285–309.
Willard, S. (1970). General topology. Reading: Addison-Wesley.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing
About this chapter
Cite this chapter
Schröder, B. (2016). Lattices. In: Ordered Sets. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-29788-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-29788-0_8
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-29786-6
Online ISBN: 978-3-319-29788-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)