Related papers: A first-order completeness result about characteri…
We prove that an abelian category equipped with an ample sequence of objects is equivalent to the quotient of the category of coherent modules over the corresponding algebra by the subcategory of finite-dimensional modules. In the…
According to the classical theorem, every irreducible algebraic variety endowed with a nontrivial rational action of a connected linear algebraic group is birationally isomorphic to a product of another algebraic variety and ${\bf P}^s$…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
In this paper, we prove the following characterization: an abelian Mal'cev variety is finitely based if and only it has finite type, its ring of idempotent binary terms is finitely presented, and its module of unary terms is finitely…
We give a novel and effective criterion for algebraicity of rational normal analytic surfaces constructed from resolving the singularity of an irreducible curve-germ on $CP^2$ and contracting the strict transform of a given line and all but…
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial…
We study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…
We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…
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…
Let p be a prime, let G be a p-valuable, abelian-by-procyclic group, and let k be a field of characteristic p. We will prove that all faithful prime ideals of the completed group algebra kG are controlled by the centre of G, and a complete…
In this paper, we study Novikov algebras satisfying nontrivial identities. We show that a Novikov algebra over a field of zero characteristic that satisfies a nontrivial identity satisfies some unexpected "universal" identities, in…
In Hayashi and Leigh (2024), the authors formulate classical number realisability for first-order arithmetic and a corresponding axiomatic system based on Krivine's classical realisability interpretation. This paper presents a…
An equivalent condition for an element of a Lie algebra acting nilpotently in all its representations is obtained. Namely, it should belong to the derived algebra and go via factoring over the radical to a nilpotent element of the…
We show that for fields that are of characteristic 0 or algebraically closed of characteristic greater than 5, that certain classes of Leibniz algebras are 2-recognizeable. These classes are solvable, strongly solvable and super solvable.…
Together with Koenig and Ovsienko, the first author showed that every quasi-hereditary algebra can be obtained as the (left or right) dual of a directed bocs. In this monograph, we prove that if one additionally assumes that the bocs is…
We introduce Clerical, a programming language for exact real-number computation that combines first-order imperative-style programming with a limit operator for computation of real numbers as limits of Cauchy sequences. We address the…
The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language. But…
In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…