Related papers: Visibly Pushdown Languages and Free Profinite Alge…

Following the classical approach of Birkhoff, we suggest an enriched version of enriched universal algebra. Given a suitable base of enrichment $\mathcal V$, we define a language $\mathbb L$ to be a collection of $(X,Y)$-ary function…

We introduce a concept of approximately invertible elements in non-unital normed algebras which is, on one side, a natural generalization of invertibility when having approximate identities at hand, and, on the other side, it is a direct…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

We introduce a new class of finite dimensional gentle algebras, the surface algebras, which are constructed from an unpunctured Riemann surface with boundary and marked points by introducing cuts in internal triangles of an arbitrary…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order,…

We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Negation and uncertainty modeling are long-standing tasks in natural language processing. Linguistic theory postulates that expressions of negation and uncertainty are semantically independent from each other and the content they modify.…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…

An algebraic extended bilinear Hilbert semispace is proposed as being the natural representation space for the algebras of von Neumann.This bilinear Hilbert semispace has a well defined structure given by the representation space of an…

Quillen's notion of small object and the Gabriel-Ulmer notion of finitely presentable or generated object are fundamental in homotopy theory and categorical algebra. Do these notions always lead to rather uninteresting classes of objects in…

We introduce the notion of pie algebra for a 2-monad, these bearing the same relationship to the flexible and semiflexible algebras as pie limits do to flexible and semiflexible ones. We see that in many cases, the pie algebras are…

Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more efficiently. More specifically, they identify groups of interchangeable variables and perform inference once per…

In these notes we study the class of divisible MV-algebras inside the algebraic hierarchy of MV-algebras with product. We connect divisible MV-algebras with $\mathbb Q$-vector lattices, we present the divisible hull as a categorical…