Related papers: Priestley-style duality for filter-distributive co…
In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…
The main source of inspiration for the present paper is the work of R. Rosebrugh and R.J. Wood on constructive complete distributive lattices where the authors employ elegantly the concepts of adjunction and module in their study of ordered…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
The Vietoris space of a Stone space plays an important role in the coalgebraic approach to modal logic. When generalizing this to positive modal logic, there is a variety of relevant hyperspace constructions based on various topologies on a…
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
In natural duality theory, the piggybacking technique is a valuable tool for constructing dualities. As originally devised by Davey and Werner, and extended by Davey and Priestley, it can be applied to finitely generated quasivarieties of…
In this paper we consider topological spaces as generalised orders and characterise those spaces which satisfy a (suitably defined) topological distributive law. Furthermore, we show that the category of these spaces is dually equivalent to…
We review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…
Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions,…
We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…
Mathematicians love dualities. After a brief explanation of dualities, with examples, we turn to one of the purest and most beautiful: Isbell duality. For any category $\mathsf{C}$, this gives an adjunction between the category of…
The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…
Anyone who has ever worked with a variety~$\boldsymbol{\mathscr{A}}$ of algebras with a reduct in the variety of bounded distributive lattices will know a restricted Priestley duality when they meet one---but until now there has been no…
We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…
Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…
The ordering relation of a bounded distributive lattice L is a (distributive) (0, 1)-sublattice of L \times L. This construction gives rise to a functor \Phi from the category of bounded distributive lattices to itself. We examine the…
We formulate a refined theory of linear systems, using the methods of a previous paper, "A Theory of Branches for Algebraic Curves", and use it to give a geometric interpretation of the genus of an algebraic curve. Using principles of…
We develop a new duality for distributive and implicative meet semi-lattices. For distributive meet semi-lattices our duality generalizes Priestley's duality for distributive lattices and provides an improvement of Celani's duality. Our…
We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…