Related papers: Pseudo-Kleene algebras determined by rough sets
Kleene algebras (KA) and Kleene algebras with tests (KAT) provide an algebraic framework to capture the behavior of conventional programming constructs. This paper explores a broader understanding of these structures, in order to enable the…
We describe both the Bunce-Deddens C*-algebras and their Toeplitz versions, as crossed products of commutative C*-algebras by partial automorphisms. In the latter case, the commutative algebra has, as its spectrum, the union of the Cantor…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We investigate the structure of perfect residuated lattices, focussing especially on perfect pseudo MV-algebras. We show that perfect pseudo MV-algebras can be represented as a generalised version of kites of Dvure\v{c}enskij and Kowalski,…
In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…
In this work, we introduce a new class of Leibniz algebras, called quasi-Artinian Leibniz algebras, which generalizes the minimal condition on ideals. Furthermore, we provide some characterizations and give conditions under which a…
An algebra $A$ is said to be directly finite if each left invertible element in the (conditional) unitization of $A$ is right invertible. We show that the reduced group ${\rm C}^\ast$-algebra of a unimodular group is directly finite,…
Associated to every complex reflection group, we construct a lattice of quotients of its braid monoid-algebra, which we term nil-Hecke algebras, and which are obtained by killing all braid words that are "sufficiently long", as well as some…
We study the class of pseudo BL-algebras whose every maximal filter is normal. We present an equational base for this class and we extend these results for the class of basic pseudo hoops with fixed strong unit.
We investigate the structure theory of the variety of \emph{PBZ*-lattices} and some of its proper subvarieties. These lattices with additional structure originate in the foundations of quantum mechanics and can be viewed as a common…
Within the C*-algebraic framework of the resolvent algebra for canonical quantum systems, the structure of oscillating lattice systems with bounded nearest neighbor interactions is studied in any number of dimensions. The global dynamics of…
The correspondence between ordinary differential equations and Bethe ansatz equations for integrable lattice models in their continuum limits is generalised to vertex models related to classical simple Lie algebras. New families of…
Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is…
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations…
On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…
A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…