Related papers: Myhill-Nerode Relation for Sequentiable Structures
We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.
The class of finitely presented algebras A over a field K with a set of generators x_{1},...,x_{n} and defined by homogeneous relations of the form x_{i_1}x_{i_2}...x_{i_l}=x_{sigma(i_1)}x_{sigma(i_2)}...x_{sigma(i_l)}, where l geq 2 is a…
We describe a category of undirected graphs which comes equipped with a faithful functor into the category of (colored) modular operads. The associated singular functor from modular operads to presheaves is fully faithful, and its essential…
Monoidal closed categories naturally model NMILL, non-commutative multiplicative intuitionistic linear logic: the monoidal unit and tensor interpret the multiplicative verum and conjunction; the internal hom interprets linear implication.…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…
We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.
We demonstrate that any function $f$ from a finite set $Y$ to itself can be represented linearly. Specifically, we prove the existence of an injective map $j$ from $Y$ into a modular ring $\mathbb{Z}/m\mathbb{Z}$ and a constant $a \in…
We provide conditions on a monoidal model category $\mathcal{M}$ so that the category of commutative monoids in $\mathcal{M}$ inherits a model structure from $\mathcal{M}$ in which a map is a weak equivalence or fibration if and only if it…
We call a monoidal category ${\mathcal C}$ a Serre category if for any $C$, $D \in {\mathcal C}$ such that $C\ot D$ is semisimple, $C$ and $D$ are semisimple objects in ${\mathcal C}$. Let $H$ be an involutory Hopf algebra, $M$, $N$ two…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…
We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…