Related papers: Visibly Pushdown Languages and Free Profinite Alge…
General theory determines the notion of separable MV-algebra (equivalently, of separable unital lattice-ordered Abelian group). We establish the following structure theorem: An MV-algebra is separable if, and only if, it is a finite product…
A hard hadron-collider event is treated here as a single geometric object - the kinematics and the discrete object-type labels of all reconstructed final-state particles encoded in one multivector $\evMV\in\Cl(1,3)\otimes\Vflav$ - rather…
Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…
Lie algebras are an important class of algebras which arise throughout mathematics and physics. We report on the formalisation of Lie algebras in Lean's Mathlib library. Although basic knowledge of Lie theory will benefit the reader, none…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
Isotopic liftings of algebraic structures are investigated in the context of Clifford algebras, where it is defined a new product involving an arbitrary, but fixed, element of the Clifford algebra. This element acts as the unit with respect…
A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
In this work, we leverage the linear algebraic structure of distributed word representations to automatically extend knowledge bases and allow a machine to learn new facts about the world. Our goal is to extract structured facts from…
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…
We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…
For a smooth manifold $X$ equipped with a volume form, let $\dL$ be the Lie algebra of volume preserving smooth vector fields on $X$. A. Lichnerowicz proved that the abelianization of $\dL$ is a finite-dimensional vector space, and that its…
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest…
We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We give a language for geometry which makes curves and number fields look alike.
We propose a generic categorical framework for learning unknown formal languages of various types (e.g. finite or infinite words, weighted and nominal languages). Our approach is parametric in a monad T that represents the given type of…