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.

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.

In this book we want to explore aspects of coherence in homological algebra, that already appear in the classical situation of abelian groups or abelian categories. Lattices of subobjects are shown to play an important role in the study of homological systems, from simple chain complexes to all the structures that give rise to spectral sequences. A parallel role is played by semigroups of endorelations. These links rest on the fact that many such systems, but not all of them, live in distributive sublattices of the modular lattices of subobjects of the system. The property of distributivity allows one to work with induced morphisms in an automatically consistent way, as we prove in a ‘Coherence Theorem for homological algebra’. (On the contrary, a ‘non-distributive’ homological structure like the bifiltered chain complex can easily lead to inconsistency, if one explores the interaction of its two spectral sequences farther than it is normally done.) The same property of distributivity also permits representations of homological structures by means of sets and lattices of subsets, yielding a precise foundation for the heuristic tool of Zeeman diagrams as universal models of spectral sequences. We thus establish an effective method of working with spectral sequences, called ‘crossword chasing’, that can often replace the usual complicated algebraic tools and be of much help to readers that want to apply spectral sequences in any field. Homological Algebra: In Strongly Non-Abelian Settings Contents:IntroductionCoherence and Models in Homological AlgebraPuppe-Exact CategoriesInvolutive CategoriesCategories of Relations as RE-CategoriesTheories and ModelsHomological Theories and Their Universal ModelsAppendix A: Some Points of Category TheoryAppendix B: A Proof for the Universal Exact System Readership: Graduated students in Mathematics and professional researchers in mathematics. Keywords:Non Abelian Homological Algebra;Spectral Sequences;Distributive Lattices;Orthodox Semigroups;Categories of RelationsKey Features:A paper by E C Zeeman and the book by Hilton and Wylie (referred to below, in point 12) introduced Zeeman diagrams as a heuristic tool for representing spectral sequences. But the theory that makes this legitimate, as a theoretical method, is given here, for the first time in book form (and elsewhere it only exists in papers of mine). The universal models of many other homological systems are also given and studiedThis has never been presented elsewhere in book form, and has only been studied in a series of papers of mine, published in different journalsAs in the previous pointReviews:“The book is a fine culmination to many papers of the author going back to 1967.”Zentralblatt MATH

Algebraic methods have penetrated deeply into contemporary complex analysis, having an essential influence on both the choice of problems and on the methods for solving them. This monograph deals with the applications of distributive lattices of subspaces to problems in multidimensional complex analysis.

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.

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.