Related papers: Logical Construction of Final Coalgebras

For every semilattice $\mathcal{A}=(A,+)$, the set $\mathrm{End}(\mathcal{A})$ of its endomorphisms forms a semiring under pointwise addition and composition. We prove that that if $\mathcal{A}$ is finite, then the endomorphism semiring…

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…

We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…

If $G$ is a group, then we say that the functor $H^n(G,-)$ is finitary if it commutes with all filtered colimit systems of coefficient modules. We investigate groups with cohomology almost everywhere finitary; that is, groups with $n$th…

We settle an old conjecture of Karrass and Solitar by proving that a finitely generated subgroup of a non-trivial free product $G = A\ast B$ has finite index if and only if it intersects non-trivially each non-trivial normal subgroup of…

For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…

We define the Hall algebra associated to any triangulated category under some finiteness conditions with the $t$-periodic translation functor $T$ for odd $t>1.$ This generalizes the results in \cite{Toen2005} and \cite{XX2006}.

Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Let $\mathcal{E}$ be the class of finite-dimensional algebras isomorphic to endomorphism algebras of silting complexes over hereditary abelian categories. It is proved that the class $\mathcal{E}$ is closed under taking idempotent…

We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…

We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…

Kastermans proved that consistently $\bigoplus_{\aleph_1} \mathbb{Z}_2$ has a cofinitary representation. We present a short proof that $\bigoplus_{\mathfrak{c}} \mathbb{Z}_2$ always has an arithmetic cofinitary representation. Further, for…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

We prove that the semantics of intuitionistic linear logic in vector spaces which uses cofree coalgebras is also a model of differential linear logic, and that the Cartesian closed category of cofree coalgebras is a model of the…