Related papers: Matrix Expression of Finite Boolean-type Algebras
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
We introduce ocLTL, the case of LTL+P modulo {\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula…
In this paper, we consider the twisted Hamiltonian extended affine Lie algebra (THEALA). We classify the irreducible integrable modules for these Lie algebras with finite-dimensional weight spaces when the finite-dimensional center acts…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
The authors of this article intend to present some results obtained in the study of biderivations of complete Lie algebras. Firstly they present a matricial approach to do this, which was a useful and explanatory tool not only in the study…
We study well-rounded ideal lattices from totally definite quaternion algebras. We prove existence and classification results, and illustrate our methods with examples.
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
A tiling with infinite rotational symmetry, such as the Conway-Radin Pinwheel Tiling, gives rise to a topological dynamical system to which an \'etale equivalence relation is associated. A groupoid C*-algebra for a tiling is produced and a…
We demonstrate that the generalization of the relativistic Toda chain (RTC) is a special reduction of two-dimensional Toda Lattice hierarchy (2DTL). This reduction implies that the RTC is gauge equivalent to the discrete AKNS hierarchy and,…
The reticulation of an algebra $A$ is a bounded distributive lattice ${\cal L}(A)$ whose prime spectrum of filters or ideals is homeomorphic to the prime spectrum of congruences of $A$, endowed with the Stone topologies. We have obtained a…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
For every regular cardinal kappa there exists a simple complete Boolean algebra with kappa generators.
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
A commutative associative algebra $A$ over ${\mathbb C}$ with a derivation is one of the simplest examples of a vertex algebra. However, the differences between the modules for $A$ as a vertex algebra and the modules for $A$ as an…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative…
We classify simple representations of Khovanov-Lauda-Rouquier algebras in finite type. The classification is in terms of a standard family of representations that is shown to yield the dual PBW basis in the Grothendieck group. Finally, we…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…