Related papers: Injectives in residuated algebras
Using cocycle twists for associative graded algebras, we characterize finite dimensional nilpotent Lie color algebras $L$ graded by arbitrary abelian groups whose enveloping algebras $U(L)$ have the property that the injective hulls of…
The notion of $n$-normal residuated lattice, as a class of residuated lattices in which every prime filter contains at most $n$ minimal prime filters, is introduced and studied. Before that, the notion of $\omega$-filter is introduced and…
It is well known that every MV-algebra can be converted into a residuated lattice satisfying divisibility and the double negation law. In our previous papers we introduced the concept of an NMV-algebra which is a non-associative…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
We introduce the concept of a quasiresiduated lattice and prove that every lattice effect algebra can be organized into a commutative quasiresiduated lattice with divisibility. Also conversely, every such a lattice can be converted into a…
The residuated lattices form one of the most important algebras of fuzzy logics and have been heavily studied by people from various different points of view. Sheaf presentations provide a topological approach to many algebraic structures.…
Let L be a quantifier predicate logic. Let K be a class of algebras. We say that K is sensitive to L, if there is an algebra in K, that is L interpretable into an another algebra, and this latter algebra is elementary equivalent to an…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
A nucleus $\gamma$ on a (bounded commutative integral) residuated lattice $\mathbf{A}$ is a closure operator that satisfies the inequality $\gamma(a) \cdot \gamma(b) \leq \gamma(a \cdot b)$ for all $a,b \in A$. In this article, among…
There are many analogies between codes, lattices, and vertex operator algebras. For example, extremal objects are good examples of combinatorial, spherical, and conformal designs. In this study, we investigated these objects from the aspect…
Inductions and game semantics are two useful extensions to traditional logic programming. To be specific, inductions can capture a wider class of provable formulas in logic programming. Adopting game semantics can make logic programming…
Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subuintuitionistic…
Schunck classes, saturated formations and projectors were originally defined for finite soluble groups for which they provided families of intravariant subgroups. In this paper, I set out the analogous theory for finite-dimensional soluble…
We show that the term equivalence between MV-algebras and MV-semirings lifts to involutive residuated lattices and a class of semirings called \textit{involutive semirings}. The semiring perspective helps us find a necessary and sufficient…
When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce the connective implication to be everywhere defined and satisfying (left) adjointness with the connective…
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…
A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occurs in abstract model theory, institution theory and in algebraic logic. Logic families…