The DOI matches its Crossref record.
Introduction to Lattices and Order
Abstract
This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Discovering Frequent Closed Itemsets for Association Rules
Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_25 · Cited by 1,378
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
Qualia: The Geometry of Integrated Information
Balduzzi, D., & Tononi, G. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000462 · Cited by 269
Efficient algorithms for collision avoidance at intersections
Colombo, A., & Del Vecchio, D. (2012) · Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control · doi:10.1145/2185632.2185656 · Cited by 134
Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings
Ren, H., Hu, W., & Leskovec, J. (2020) · arXiv · doi:10.48550/arxiv.2002.05969 · Cited by 135
Metadata
- Authors
- Davey, B. A., & Priestley, H. A.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2002-04-18
- OpenAlex
- W2093397547
- Cited by
- 4,901
- References
- 0
- FWCI
- 36.07
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Introduction to Lattices and Order. https://app.cochat.ai/papers/10.1017/cbo9780511809088
- The paper
- Davey, B. A., & Priestley, H. A. (2002). Introduction to Lattices and Order. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511809088
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.