A thorough treatment of free lattices, including such aspects as Whitman's solution to the word problem, bounded monomorphisms and related concepts, totally atomic elements, infinite intervals, computation, term rewrite systems, and varieties. Includes several results that are new or have not been previously published. Annotation copyright by Book News, Inc., Portland, OR
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.
This outstanding text is written in clear language and enhanced with many exercises, diagrams, and proofs. It discusses historical developments and future directions and provides an extensive bibliography and references. 1971 edition.
This book is intended to be a thorough introduction to the subject of order and lattices, with an emphasis on the latter. It can be used for a course at the graduate or advanced undergraduate level or for independent study. Prerequisites are kept to a minimum, but an introductory course in abstract algebra is highly recommended, since many of the examples are drawn from this area. This is a book on pure mathematics: I do not discuss the applications of lattice theory to physics, computer science or other disciplines. Lattice theory began in the early 1890s, when Richard Dedekind wanted to know the answer to the following question: Given three subgroups EF , and G of an abelian group K, what is the largest number of distinct subgroups that can be formed using these subgroups and the operations of intersection and sum (join), as in E?FßÐE?FÑ?GßE?ÐF?GÑ and so on? In lattice-theoretic terms, this is the number of elements in the relatively free modular lattice on three generators. Dedekind [15] answered this question (the answer is #)) and wrote two papers on the subject of lattice theory, but then the subject lay relatively dormant until Garrett Birkhoff, Oystein Ore and others picked it up in the 1930s. Since then, many noted mathematicians have contributed to the subject, including Garrett Birkhoff, Richard Dedekind, Israel Gelfand, George Grätzer, Aleksandr Kurosh, Anatoly Malcev, Oystein Ore, Gian-Carlo Rota, Alfred Tarski and Johnny von Neumann.
This volume contains the Proceedings of ICFCA 2004, the 2nd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory and in particular scienti?c advances related to formal concept analysis. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potentialusersoflatticetheory.Sincethen,the?eldhasdevelopedintoagrowing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management. In terms of theory, formal concept analysis has been extended into attribute exploration, Boolean judgment, contextual logic and so on to create a powerful general framework for knowledge representation and reasoning. This conference aims to unify theoretical and applied practitioners who use formal concept an- ysis, drawing on the ?elds of mathematics, computer and library sciences and software engineering. The theme of the 2004 conference was ‘Concept Lattices” to acknowledge the colloquial term used for the line diagrams that appear in almost every paper in this volume. ICFCA 2004 included tutorial sessions, demonstrating the practical bene?ts of formal concept analysis, and highlighted developments in the foundational theory and standards. The conference showcased the increasing variety of formal concept analysis software and included eight invited lectures from distinguished speakersinthe?eld.Sevenoftheeightinvitedspeakerssubmittedaccompanying papers and these were reviewed and appear in this volume.
This indispensable reference source contains a wealth of information on lattice theory. The book presents a survey of virtually everything published in the fields of partially ordered sets, semilattices, lattices, and Boolean algebras that was reviewed in Referativnyi Zhurnal Matematika from mid-1982 to the end of 1985. A continuation of a previous volume (the English translation of which was published by the AMS in 1989, as volume 141 in Translations - Series 2), this comprehensive work contains more than 2200 references. Many of the papers covered here were originally published in virtually inaccessible places. The compilation of the volume was directed by Milan Kolibiar of Comenius University at Bratislava and Lev A. Skornyakov of Moscow University. Of interest to mathematicians, as well as to philosophers and computer scientists in certain areas, this unique compendium is a must for any mathematical library.
Introducing Stone–Priestley duality theory and its applications to logic and theoretical computer science, this book equips graduate students and researchers with the theoretical background necessary for reading and understanding current research in the area. After giving a thorough introduction to the algebraic, topological, logical, and categorical aspects of the theory, the book covers two advanced applications in computer science, namely in domain theory and automata theory. These topics are at the forefront of active research seeking to unify semantic methods with more algorithmic topics in finite model theory. Frequent exercises punctuate the text, with hints and references provided.
The study of lattice varieties is a field that has experienced rapid growth in the last 30 years, but many of the interesting and deep results discovered in that period have so far only appeared in research papers. The aim of this monograph is to present the main results about modular and nonmodular varieties, equational bases and the amalgamation property in a uniform way. The first chapter covers preliminaries that make the material accessible to anyone who has had an introductory course in universal algebra. Each subsequent chapter begins with a short historical introduction which sites the original references and then presents the results with complete proofs (in nearly all cases). Numerous diagrams illustrate the beauty of lattice theory and aid in the visualization of many proofs. An extensive index and bibliography also make the monograph a useful reference work.
0.1. General remarks. For any algebraic system A, the set SubA of all subsystems of A partially ordered by inclusion forms a lattice. This is the subsystem lattice of A. (In certain cases, such as that of semigroups, in order to have the right always to say that SubA is a lattice, we have to treat the empty set as a subsystem.) The study of various inter-relationships between systems and their subsystem lattices is a rather large field of investigation developed over many years. This trend was formed first in group theory; basic relevant information up to the early seventies is contained in the book [Suz] and the surveys [K Pek St], [Sad 2], [Ar Sad], there is also a quite recent book [Schm 2]. As another inspiring source, one should point out a branch of mathematics to which the book [Baer] was devoted. One of the key objects of examination in this branch is the subspace lattice of a vector space over a skew field. A more general approach deals with modules and their submodule lattices. Examining subsystem lattices for the case of modules as well as for rings and algebras (both associative and non-associative, in particular, Lie algebras) began more than thirty years ago; there are results on this subject also for lattices, Boolean algebras and some other types of algebraic systems, both concrete and general. A lot of works including several surveys have been published here.
