zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Introduction to lattices and order. 2nd ed. (English) Zbl 1002.06001
Cambridge: Cambridge University Press. xii, 298 p. £ 19.95; $ 30.00 (2002).
The second edition is substantially different from the original one published in 1990 (see Zbl 0701.06001). It is an excellent textbook on ordered sets and lattices and it is intended for undergraduate and beginning graduate students in mathematics. A basic theory of order and lattices accessible to the students is given. The textbook shows the importance of the concept of order in algebra, logic, computer science and other fields. Many examples that illustrate this can be found here. The textbook is divided into 11 chapters: Ordered sets, Lattices and complete lattices, Formal concept analysis, Modular, distributive and Boolean lattices, Representation: the finite case, Congruences, Complete lattices and Galois connections, CPOs and fixpoint theorems, Domains and informations systems, Maximality principles, Representation: the general case. Each chapter is followed by exercises (there are 273 exercises). The book ends with two appendices. Appendix A provides a very concise summary of the results from topology needed in the last chapter. Appendix B gives references and suggestions for further reading.

06-01Textbooks (ordered structures)