Related papers: Finitary Corecursion for the Infinitary Lambda Cal…
We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…
We construct the first example of a finitely generated group which has Serre's property (FA) (i.e., whenever it acts on a simplicial tree it fixes a vertex), but admits a fixed point-free action on an $\mathbb{R}$-tree with finite arc…
An Artin algebra $\Lambda$ is said to be of finite Cohen-Macaulay type, $\rm{CM}$-finite for short, if the full subcategory $\rm{Gprj}\mbox{-} \Lambda$ of finitely generated Gorenstein projective $\Lambda$-modules is of finite…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine…
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a…
We show that every finite abelian group $G$ occurs as the group of rational points of an ordinary abelian variety over $\mathbb{F}_2$, $\mathbb{F}_3$ and $\mathbb{F}_5$. We produce partial results for abelian varieties over a general finite…
We consider algebras defined over a complete, local and noetherian ground ring. They are gentle algebras in case the ground ring is a field. The unbounded homotopy category of complexes of projective modules is considered. Complexes with…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…
In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…
We determine the singularity category of an arbitrary finite dimensional gentle algebra $\Lambda$. It is a finite product of $n$-cluster categories of type $\mathbb{A}_{1}$. Equivalently, it may be described as the stable module category of…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…
We show that the modular group has an infinite family of finite index subgroups, each of which has the same trace set as the modular group itself. Various congruence subgroups of the modular group, and the Bianchi groups, are also shown to…
This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for the program and a given query. A general property of…
The finite condensation $\sim_F$ is an equivalence relation defined on a linear order $L$ by $x \sim_F y$ if and only if the set of points lying between $x$ and $y$ is finite. We define an operation $\cdot_F$ on linear orders $L$ and $M$ by…
Let $\Lambda$ be an artin algebra and $\mathcal{C}$ be a functorially finite subcategory of mod$\Lambda$ which contains $\Lambda$ or $D\Lambda$. We use the concept of the infinite radical of $\mathcal{C}$ and show that $\mathcal{C}$ has an…