Related papers: Pro-aperiodic monoids via saturated models
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…
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,…
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,…
A pseudogroup is a complete infinitely distributive inverse monoid. Such inverse monoids bear the same relationship to classical pseudogroups of transformations as frames do to topological spaces. The goal of this paper is to develop the…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…
This article studies the properties of word-hyperbolic semigroups and monoids, i.e. those having context-free multiplication tables with respect to a regular combing, as defined by Duncan & Gilman. In particular, the preservation of…
We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
We show how Stone duality can be extended from maps to relations. This is achieved by working order enriched and defining a relation from A to B as both an order-preserving function from the opposite of A times B to the 2-element chain and…
We prove that the category of boolean inverse monoids is dually equivalent to the category of boolean groupoids. This generalizes the classical Stone duality between boolean algebras and boolean spaces. As an instance of this duality, we…
We prove a new duality theorem for the category of precontact algebras which implies the Stone Duality Theorem, its connected version obtained in arXiv:1508.02220v3, 1-44 (to appear in Topology Appl.), the recent duality theorems of…
We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…
In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…
We introduce a diagramatic notation for supersymmetric gauge theories. The notation is a tool for exploring duality and helps to present the field content of more complicated models in a simple visual way. We introduce the notation with a…
In this thesis we propose and study a theory of ordered locales, a type of point-free space equipped with a preorder structure on its frame of opens. It is proved that the Stone-type duality between topological spaces and locales lifts to a…
We introduce a notion of the space of types in positive model theory based on Stone duality for distributive lattices. We show that this space closely mirrors the Stone space of types in the full first-order model theory with negation…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M. For string compression, straight-line programs, i.e., context-free grammars that…