Related papers: Parsing as a lifting problem and the Chomsky-Sch\"…
Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order theory on a given finite domain. WFOMC has emerged as a fundamental tool for probabilistic inference. Algorithms for WFOMC that run in…
A concrete model of the free skew-monoidal category Fsk on a single generating object is obtained. The situation is clubbable in the sense of G.M. Kelly, so this allows a description of the free skew-monoidal category on any category. As…
Multivariate versions of the Kronecker theorem in the continuous multivariate setting has recently been published. These theorems characterize the symbols that give rise to finite rank multidimensional Hankel and Toeplitz type operators…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
Let $k$ be a field, and let $\mathcal{C}$ be a Cauchy complete $k$-linear braided category with finite dimensional morphism spaces and ${{\rm End}(\bf 1)}=k$. We call an indecomposable object $X$ of $\mathcal C$ non-negligible if there…
It is shown how double categories provide a direct abstract approach to coloured operads; namely, product-preserving normal lax functors from (Pb C)^op (the opposite of the double category of pullback squares in C) to Cat (the double…
We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…
We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with respect to the proven formula. CFP is an intuitionistic…
We show that the category OS of operator spaces, with complete contractions as morphisms, is locally countably presentable. This result, together with its symmetric monoidal closed structure with respect to the projective tensor product of…
Transformer-based language models are effective but complex, and understanding their inner workings and reasoning mechanisms is a significant challenge. Previous research has primarily explored how these models handle simple tasks like name…
Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic inference in statistical relational learning models. As WFOMC is known to be intractable in general ($\#$P-complete), logical fragments that admit polynomial time…
An F-system is a computational model that performs a folding operation on words of a given language, following directions coded on words of another given language. This paper considers the case in which both given languages are regular, and…
In previous work ("From signatures to monads in UniMath"), we described a category-theoretic construction of abstract syntax from a signature, mechanized in the UniMath library based on the Coq proof assistant. In the present work, we…
In this chapter we discuss the problem of enumerating distinct regular expressions by size and the regular languages they represent. We discuss various notions of the size of a regular expression that appear in the literature and their…
Operads often arise from geometry. The standard $A_\infty$ operad can be derived from the cellular chains on the Stasheff associahedra, and an $A_\infty$ algebra is an algebra over this operad. The notion of an $\mathbf{fc}$-multicategory,…
Let A be a unital simple separable C*-algebra with strict comparison of positive elements. We prove that the Cuntz semigroup of A is recovered functorially from the Murray-von Neumann semigroup and the tracial state space T(A) whenever the…
If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functor D --> Set, gives a representable functor in the classical…
The purpose of this article is threefold: Firstly, we propose some enhancements to the existing definition of 6-functor formalisms. Secondly, we systematically study the category of kernels, which is a certain 2-category attached to every…
The associative operad is a central structure in operad theory, defined on the linear span of the set of permutations. We build two analogs of the associative operad on the linear span of the set of packed words which turn out to be…