Results 11 to 20 of about 275 (133)
Priestley duality for some algebras with a negation operator
In \cite{Celani} it was introduced the variety of ¬-lattices as bounded distributive lattice A endowed with a unary operation ¬, satisfying the axioms ¬0≈1 and ¬(a∨b)≈¬a∧¬b. In this paper we shall apply the Priestley duality developed in \cite{Celani} to give a unified, short and self-contained Priestley duality for semi-De Morgan algebras, demi-p ...
Celani, Sergio A., Celani, Sergio Arturo
openaire +3 more sources
The authors investigate a topological representation for some algebraic structures of fuzzy logic using the results given in [\textit{S. A. Celani}, ``Bounded distributive lattices with fusion and implication'', Southeast Asian Bull. Math. 28, 999--1010 (2004; Zbl 1065.03050)].
Cabrer Leonardo, Celani Sergio
doaj +3 more sources
Connecting generalized Priestley duality to Hofmann-Mislove-Stralka duality [PDF]
We connect Priestley duality for distributive lattices and its generalization to distributive meet-semilattices to Hofmann-Mislove-Stralka duality for semilattices. Among other things, this involves consideration of various morphisms between algebraic frames. We also show how Stone duality for boolean algebras and generalized boolean algebras fits as a
G. Bezhanishvili +2 more
openaire +5 more sources
Priestley-type dualities for partially ordered structures
44 ...
CARAMELLO, OLIVIA
openaire +5 more sources
Priestley duality and representations of recurrent dynamics
For an arbitrary dynamical system there is a strong relationship between global dynamics and the order structure of an appropriately constructed Priestley space. This connection provides an order-theoretic framework for studying global dynamics. In the classical setting, the chain recurrent set, introduced by C.
Kalies, William, Vandervorst, Robert
openaire +3 more sources
Expanding Belnap 2: the dual category in depth [PDF]
Bilattices, which provide an algebraic tool for simultaneously modelling knowledge and truth, were introduced by N.D. Belnap in a 1977 paper entitled How a computer should think.
Andrew Craig +2 more
doaj +1 more source
A duality theoretic view on limits of finite structures: Extended version [PDF]
A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a space of ...
Mai Gehrke, Tomáš Jakl, Luca Reggio
doaj +1 more source
Distributive lattices with strong endomorphism kernel property as direct sums [PDF]
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (
Jaroslav Gurican
doaj +1 more source
Incidence structures and Stone–Priestley duality [PDF]
We observe that if $R:=(I,ρ, J)$ is an incidence We observe that if $R:=(I,ρ, J)$ is an incidence structure, viewed as a matrix, then the topological closure of the set of columns is the Stone space of the Boolean algebra generated by the rows. As a consequence, we obtain that the topological closure of the collection of principal initial segments of a
Mohamed Bekkali +2 more
openaire +3 more sources
Restricted Priestley Dualities and Discriminator Varieties [PDF]
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 abstract definition. Here we provide one.
Brian A. Davey, A. Gair
openaire +3 more sources

