Related papers: Stone duality, topological algebra, and recognitio…
ASD (Abstract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same category as the original space, with an associated…
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The problem of determining for a given regular tree language whether…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
Double Boolean algebras (dBas), introduced by Wille, are based on twenty-three identities. We present a simplified axiom system, the D-core algebra, and prove it is equivalent to Wille's original definition. This reduction allows improved…
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…
Recently in \cite{FM, FlMo}, the language of MV-algebras was extended by adding a unary operation, an internal operator, called also a state-operator. In \cite{DD1}, a stronger version of state MV-algebras, called state-morphism MV-algebras…
It is a classic result in modal logic that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous.…
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…
This is a survey on selected developments in the theory of natural dualities where the author had the opportunity to make with his foreign colleagues several breakthroughs and move the theory forward. It is aimed as author's reflection on…
We study the notion of duality in the context of graded manifolds. For graded bundles, somehow like in the case of Gelfand representation and the duality: points vs. functions, we obtain natural dual objects which belongs to a different…
We first present a Priestley-style dualitiy for the classes of algebras that are the algebraic counterpart of some congruential, finitary and filter-distributive logic with theorems. Then we analyze which properties of the dual spaces…
The notion of quadratic self-duality for coalgebras is developed with applications to algebraic structures which arise naturally in algebraic topology, related to the universal Steenrod algebra via an appropriate form of duality. This…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
We introduce the Boolean algebra of d-semialgebraic (more generally, d-definable) sets and prove that its Stone space is naturally isomorphic to the Ellis enveloping semigroup of the Stone space of the Boolean algebra of semialgebraic…
Various topological concepts are often involved in the research of mathematical logic, and almost all of these concepts can be regarded as developing from the Stone representation theorem. In the Stone representation theorem, a Boolean…
The Boolean algebra of regular closed sets is prominent in topology, particularly as a dual for the Stone-Cech compactification. This algebra is also central for the theory of geometric computation, as a representation for combinatorial…
Open sets and compact saturated sets enjoy a perfect formal symmetry, at least for classes of spaces such as Stone spaces or spectral spaces. For larger classes of spaces, a perfect symmetry may not be available, although strong signs of it…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
In this paper some applications of the methods and results of its first part and of the results of M. Stone, H. de Vries, P. Roeper are given. In particular: some generalizations of the Stone Duality Theorem are obtained; a completion…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…