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. (shrink)

This paper focuses on natural dualities for varieties of bilattice-based algebras. Such varieties have been widely studied as semantic models in situations where information is incomplete or inconsistent. The most popular tool for studying bilattices-based algebras is product representation. The authors recently set up a widely applicable algebraic framework which enabled product representations over a base variety to be derived in a uniform and categorical manner. By combining this methodology with that of natural duality theory, we demonstrate how to build (...) a natural duality for any bilattice-based variety which has a suitable product representation over a dualisable base variety. This procedure allows us systematically to present economical natural dualities for many bilattice-based varieties, for most of which no dual representation has previously been given. Among our results we highlight that for bilattices with a generalised conflation operation. Here both the associated product representation and the duality are new. Finally we outline analogous procedures for pre-bilattice-based algebras. (shrink)

The techniques of natural duality theory are applied to certain finitely generated varieties of Heyting algebras to obtain optimal dualities for these varieties, and thereby to address algebraic questions about them. In particular, a complete characterisation is given of the endodualisable finite subdirectly irreducible Heyting algebras. The procedures involved rely heavily on Priestley duality for Heyting algebras.

Both syntactic and semantic solutions are given for the entailment problem of duality theory. The test algebra theorem provides both a syntactic solution to the entailment problem in terms of primitive positive formulae and a new derivation of the corresponding result in clone theory, viz. the syntactic description of $\operatorname{Inv(Pol}(R))$ for a given set R of finitary relations on a finite set. The semantic solution to the entailment problem follows from the syntactic one, or can be given in the form (...) of an algorithm. It shows, in the special case of a purely relational type, that duality-theoretic entailment is describable in terms of five constructs, namely trivial relations, intersection, repetition removal, product, and retractive projection. All except the last are concrete, in the sense that they are described by a quantifier-free formula. It is proved that if the finite algebra $\underline{M}$ generates a congruence-distributive variety and all subalgebras of $\underline{M}$ are subdirectly irreducible, then concrete constructs suffice to describe entailment. The concept of entailment appropriate to strong dualities is also introduced, and described in terms of coordinate projections, restriction of domains, and composition of partial functions. (shrink)

Natural dualities are developed for varieties ofn-valued ukasiewicz algebras with and without negation. These dualities are based on hom-functors, and parallel Stone duality for Boolean algebras. A translation is described which relates the natural dualities to the corresponding restricted Priestley dualities. This enables a unified approach to free algebras to be presented, whence R. Cignoli's characterisations of the finitely generated free algebras are elucidated and new descriptions of arbitrary free algebras obtained. Finally it is shown how dualities for subvarieties encode (...) equational bases. An alternative approach is thereby provided to results of M.E. Adams and R. Cignoli. (shrink)

The paper investigates completions in the context of finitely generated lattice-based varieties of algebras. In particular the structure of canonical extensions in such a variety $${\mathcal {A}}$$ is explored, and the role of the natural extension in providing a realisation of the canonical extension is discussed. The completions considered are Boolean topological algebras with respect to the interval topology, and consequences of this feature for their structure are revealed. In addition, we call on recent results from duality theory to show (...) that topological and discrete dualities for $${\mathcal {A}}$$ exist in partnership. (shrink)

This paper is a study of duality in the absence of canonicity. Specifically it concerns double quasioperator algebras, a class of distributive lattice expansions in which, coordinatewise, each operation either preserves both join and meet or reverses them. A variety of DQAs need not be canonical, but as has been shown in a companion paper, it is canonical in a generalized sense and an algebraic correspondence theorem is available. For very many varieties, canonicity (as traditionally defined) and correspondence lead on (...) to topological dualities in which the topological and correspondence components are quite separate. It is shown that, for DQAs, generalized canonicity is sufficient to yield, in a uniform way, topological dualities in the same style as those for canonical varieties. However topology and correspondence are no longer separable in the same way. (shrink)