Related papers: Syntactic Monoids in a Category
Formally verifying the properties of formal systems using a proof assistant requires justifying numerous minor lemmas about capture-avoiding substitution. Despite work on category-theoretic accounts of syntax and variable binding, raw,…
We establish an Eilenberg-type correspondence for data languages, i.e. languages over an infinite alphabet. More precisely, we prove that there is a bijective correspondence between varieties of languages recognized by orbit-finite nominal…
We study distributional learning of context-free languages under a fixed recognizable congruence $\sim_h$ given as the kernel of an explicit finite monoid homomorphism $h:\Sigma^*\to M$. For this fixed-$h$ setting, we develop a finite typed…
We prove that the category of dg-coalgebras is symmetric monoidal closed and that the category of dg-algebras is enriched, tensored, cotensored and strongly monoidal over that of coalgebras. We apply this formalism to reconstruct several…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff…
In this note, we give a characterisation in terms of identities of the join of $\mathbf{V}$ with the variety of finite locally trivial semigroups $\mathbf{LI}$ for several well-known varieties of finite monoids $\mathbf{V}$ by using…
Skew-monoidal categories arise when the associator and the left and right units of a monoidal category are, in a specific way, not invertible. We prove that the closed skew-monoidal structures on the category of right R-modules are…
I describe a generalization of the notion of operadic category due to Batanin and Markl. For each such operadic category I describe a skew monoidal category of collections, such that a monoid in this skew monoidal category is precisely an…
This thesis deals with two main topics: virtual double categories as semantics environments for predicate logic, and a syntactic presentation of virtual double categories as a type theory. One significant principle of categorical logic is…
We consider algebras over a field K defined by a presentation K <x_1,..., x_n : R >, where $R$ consists of n choose 2 square-free relations of the form x_i x_j = x_k x_l with every monomial x_i x_j, i different from j, appearing in one of…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
We study the equational theories and bases of meets and joins of several varieties of plactic-like monoids. Using those results, we construct sublattices of the lattice of varieties of monoids, generated by said varieties. We calculate the…
Firstly, we generalize a semi-classical limit of open strings on D-branes in group manifolds. The limit gives rise to rigid open strings, whose dynamics can efficiently be described in terms of a matrix algebra. Alternatively, the dynamics…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
We give an algebraic characterization of the syntax and semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed binding syntax equipped with reduction rules via a universal property, namely as…
Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our…
In this paper, we classify finite categories with two objects such that one of the endomorphism monoids is a group. We prove that having a group on one side affects the structure of the other endomorphism monoid, and we prove that it is…
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…