Related papers: Syntax for Split Preorders
A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…
We introduce analogues of Soergel bimodules for complex reflection groups of rank one. We give an explicit parametrization of the indecomposable objects of the resulting category and give a presentation of its split Grothendieck ring by…
Trace semantics has been defined for various kinds of state-based systems, notably with different forms of branching such as non-determinism vs. probability. In this paper we claim to identify one underlying mathematical structure behind…
Starting from pseudometrics and preorders on sets of integers, we extend the focus to sets of finite sequences of integers, in particular sequences of consecutive integers. We outline existing concepts for deriving centred pseudometrics and…
We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Let R be a Stanley-Reisner ring (that is, a reduced monomial ring) with coefficients in a domain k, and K its associated simplicial complex. Also let D_k(R) be the ring of k-linear differential operators on R. We give two different…
In this paper, we view the collection of ideals of a commutative principal ideal ring from two perspectives: one as an ordered semigroup I(R) and the other as a category I_R . It is shown that I(R) is a regular ordered semigroup whereas I_R…
We characterize Frobenius and separable monoidal algebra extensions $i: R\ra S$ in terms given by $R$ and $S$. For instance, under some conditions, we show that the extension is Frobenius, respectively separable, if and only if $S$ is a…
Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
F\"uhrmann and Pym constructed models of classical propositional logic in an order-enriched categorical setting, whose typical example is the category $\mathbf{Rel}$ of sets and relations. It is remarkable in that they are both…
In Secion~1 we describe what is known of the extent to which a separable extension of unital associative rings is a Frobenius extension. A problem of this kind is suggested by asking if three algebraic axioms for finite Jones index…
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
Common subword tokenization algorithms like BPE and UnigramLM assume that text can be split into meaningful units by concatenative measures alone. This is not true for languages such as Hebrew and Arabic, where morphology is encoded in…
The aim of this work is to study the notions of lax protomodular and Ord-Mal'tsev category at the level of (coherent) varieties of (pre)ordered algebras and to further compare them, as has been done in the non-ordered context. We…
Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…
We address the problem of identifying a proof-theoretic framework that enables a compositional analysis of finite-trace properties in concurrent systems, with a particular focus on those specified via prefix-closure. To this end, we…