Related papers: Algebraic closures and their variations
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
We study locally finite varieties (=primitive classes) of linear algebras over finite fields. We do not assume that our algebras are associative or Lie. We are interested in the basic properties of finite algebras in these varieties such…
A self-contained description of algebraic structures, obtained by combinations of various limit procedures applied to vertex and face sl(2) elliptic quantum affine algebras, is given. New double Yangians structures of dynamical type are in…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
Svenonius theorem reduces the problem of first-order definability to the problem of relationship between groups of permutations. In the present paper we use this approach to describe the lattice of definable relations for the structure of…
We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
Potential algebras can be used effectively in the analysis of the quantum systems. In the article, we focus on the systems described by a separable, 2x2 matrix Hamiltonian of the first order in derivatives. We find integrals of motion of…
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which…
This paper introduces the notions of atoms and atomicity in $C$-algebras and obtains a characterisation of atoms in the $C$-algebra of transformations. Further, this work presents some necessary conditions and sufficient conditions for the…
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…
In Part I of this paper, we introduced a class of certain algebras of finite dimension over a field. All these algebras are split, symmetric and local. Here we continue to investigate their Loewy structure. We show that in many cases their…
We investigate the algebraic structure on the set of closure operations of a ring. We show the set of closure operations is not a monoid under composition for a discrete valuation ring. Even the set of semiprime operations over a DVR is not…
Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We discuss the problem of non abelian constrained systems and the origin of appearance of non abelian algebras. We show that it is possible, in principle, to change a non abelian system to an abelian one, at least locally. Our method is…