Quantitative Σ-algebras, where Σ is a signature with countable arities, are Σ-algebras
equipped with a metric making all operations nonexpanding. They have been studied by …

Finitary monads on Pos are characterized as precisely the free-algebra monads of varieties
of algebras. These are classes of ordered algebras specified by inequations in context …

The framework of quantitative equational logic has been successfully applied to reason
about algebras whose carriers are metric spaces and operations are nonexpansive. We …

Following the classical approach of Birkhoff, we suggest an enriched version of enriched
universal algebra. Given a suitable base of enrichment $\mathcal V $, we define a language …

Discrete equational theories Page 1 Mathematical Structures in Computer Science (2024), 1–14
doi:10.1017/S096012952400001X PAPER Discrete equational theories J. Rosický Department …

Positive data languages are languages over an infinite alphabet closed under possibly non-
injective renamings of data values. Informally, they model properties of data words …

This thesis deals with two quite unrelated subjects in Computer Science: one is the
relationship between algebraic theories and monads, the other one is the study of adhesivity …

Profinite equations are an indispensable tool for the algebraic classification of formal
languages. Reiterman's theorem states that they precisely specify pseudovarieties, ie …

We introduce a class of algebras that can be used as recognisers for regular tree languages.
We show that it is the only such class that forms a pseudo-variety and we prove the …

We propose a novel topological perspective on data languages recognizable by orbit-finite
nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces …