Introduction to Lattices and Order
Ordered structures have been increasingly recognized in recent years due to an explosion of interest in theoretical computer science and all areas of discrete mathematics. This book covers areas such as ordered sets and lattices. A key feature of ordered sets, one which is emphasized in the text, is that they can be represented pictorially. Lattices are also considered as algebraic structures and hence a purely algebraic study is used to reinforce the ideas of homomorphisms and of ideals encountered in group theory and ring theory. Exposure to elementary abstract algebra and the rotation of set theory are the only prerequisites for this text. For the new edition, much has been rewritten or expanded and new exercises have been added.
- Second edition of a successful textbook
- Improved presentation and new exercises
- Remains a unique introduction to the subject for mathematicians and computer scientists
Reviews & endorsements
"...this second edition merits the same five stars as the first."
Mathematical Reviews
"The book is written in a very engaging and fluid style. The understanding of the content is aided tremendously by the very large number of beautiful lattice diagrams...The book provides a wonderful and accessible introduction to lattice theory, of equal interest to both computer scientists and mathematicians."
Jonathan Cohen, SIGACT News
Product details
May 2002Paperback
9780521784511
312 pages
229 × 152 × 17 mm
0.42kg
36 b/w illus. 75 exercises
Available
Table of Contents
- Preface
- Preface to the first edition
- 1. Ordered sets
- 2. Lattices and complete lattices
- 3. Formal concept analysis
- 4. Modular, distributive and Boolean lattices
- 5. Representation theory: the finite case
- 6. Congruences
- 7. Complete lattices and Galois connections
- 8. CPOs and fixpoint theorems
- 9. Domains and information systems
- 10. Maximality principles
- 11. Representation: the general case
- Appendix A. A topological toolkit
- Appendix B. Further reading
- Notation index
- Index.