相关论文: Substitution Principle and semidirect products

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,…

Combining ideas coming from Stone duality and Reynolds parametricity, we formulate in a clean and principled way a notion of profinite lambda-term which, we show, generalizes at every type the traditional notion of profinite word coming…

We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…

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…

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…

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

This paper is an extended version of our proceedings paper announced at LICS'16; in order to complement it, this version is written from a different viewpoint including topos-theoretic aspect on our work. Technically, this paper introduces…

This book is a course in Stone-Priestley duality theory, with applications to logic and theoretical computer science. Our target audience are graduate students and researchers in mathematics and computer science. Our aim is to get in a…

We investigate in a method for proving separation results for abstract classes of languages. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these…

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 show that, if S is a finite semiring, then the free profinite S-semimodule on a Boolean Stone space X is isomorphic to the algebra of all S-valued measures on X, which are finitely additive maps from the Boolean algebra of clopens of X…

We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…

Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence,…

This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one…

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

Boolean spaces with internal semigroups generalize profinite semigroups and are pertinent for the recognition of not-necessarily regular languages. Via recognition, the study of existential quantification in logic on words amounts to the…

A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…