Related papers: Algebraic Notions of Termination
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…
In semantics and in programming practice, algebraic concepts such as monads or, essentially equivalently, (large) Lawvere theories are a well-established tool for modelling generic side-effects. An important issue in this context are…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
A description of a ring of functions on the base of a universal formal deformation for several moduli problems is given. The answer is given in terms of a homology group of a certain dg Lie algebra canonically (up to an essentially unique…
Ideas from deformation quantization applied to algebras with one generator lead to methods to treat a nonlinear flat connection. It provides us elements of algebras to be parallel sections. The moduli space of the parallel sections is…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
This work presents a sample constructions of two algebras both with the ideal of relations defined by a finite Gr\"obner basis. For the first algebra the question whether a given element is nilpotent is algorithmically unsolvable, for the…
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…
This note surveys how the exterior algebra and deformations or quotients of it, gives rise to centrally important notions in five domains of mathematics: Combinatorics, Topology, Lie theory, Mathematical physics, and Algebraic geometry.
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
We explore various formality and finiteness properties in the differential graded algebra models for the Sullivan algebra of piecewise polynomial rational forms on a space. The 1-formality property of the space may be reinterpreted in terms…
We develop the theory of central ideals on commutative rings. We introduce and study the central seminormalization of a ring in another one. This seminormalization is related to the theory of regulous functions on real algebraic varieties.…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…
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…
A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…