No label defined (Q4530231)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1748069
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1748069

      Statements

      0 references
      0 references
      2 June 2002
      0 references
      lattice
      0 references
      partial order
      0 references
      distributive lattices
      0 references
      complete lattices
      0 references
      Boolean lattice
      0 references
      Galois connection
      0 references
      formal concept analysis
      0 references
      fixpoint theorems
      0 references
      applications
      0 references
      computer science
      0 references
      filters
      0 references
      ideals
      0 references
      ordered sets
      0 references
      social science
      0 references
      algebraic lattices
      0 references
      subalgebraic structures
      0 references
      Boolean algebra
      0 references
      Lindenbaum algebra
      0 references
      congruences
      0 references
      CPO
      0 references
      domains
      0 references
      informations systems
      0 references
      representation
      0 references
      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.
      0 references

      Identifiers