Related papers: Residuated operators in complemented posets
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
The concept of operator left residuation has been introduced by the authors in a previous paper. Modifications of so-called quantum structures, in particular orthomodular posets, like pseudo-orthomodular, pseudo-Boolean and Boolean posets…
We show that for every orthomodular poset P of finite height there can be defined two operators forming an adjoint pair with respect to an order-like relation defined on the power set of P. This enables us to introduce the so-called…
The concept of operator residuation for bounded posets with unary operation was introduced by the first two authors. It turns out that in some cases when these operators are transformed into lattice terms and the poset ${\mathbf P}$ is…
It is known that every relatively pseudocomplemented lattice is residuated and, moreover, it is distributive. Unfortunately, non-distributive lattices with a unary operation satisfying properties similar to relative pseudocomplementation…
Given a complemented poset P, we can assign to every element x of P the set x^+ of all its complements. We study properties of the operator ^+ on P, in particular, we are interested in the case when x^+ forms an antichain or when ^+ is…
A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le…
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…
M. Busaniche, R. Cignoli, C. Tsinakis and A. M. Wille showed that every residuated lattice induces a residuation on its full twist product. For their construction they used also lattice operations. We generalize this problem to…
The aim of the present paper is to generalize the concept of residuated poset, by replacing the usual partial ordering by a generic binary relation, giving rise to relational systems which are residuated. In particular, we modify the…
For orthoposets we introduce a binary relation Delta and a binary operator d(x,y) which are generalizations of the binary relation C and the commutator c(x,y), respectively, known for orthomodular lattices. We characterize orthomodular…
Sectional pseudocomplementation (sp-complementation) on a poset is a partial operation $*$ which associates with every pair $(x,y)$ of elements, where $x \ge y$, the pseudocomplement $x*y$ of $x$ in the upper section $[y)$. Any total…
Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
Effect algebras and pseudoeffect algebras were introduced by Foulis, Bennett, Dvurecenskij and Vetterlein as so-called quantum structures which serve as an algebraic axiomatization of the logic of quantum mechanics. A natural question…
We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…
This paper investigates the intersection of residuated structures from many-valued logic and orthomodular lattices from quantum logic. We explore whether non-Boolean structures can simultaneously satisfy residuation principles and…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…