Abstract The Sasaki projection was introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. To use this projection and its dual so-called Sasaki operations were introduced by the second two authors in [4] and [6]. In [6] there are described several classes of lattices, $\lambda $-lattices and semirings where the Sasaki operations form an adjoint pair. In the present paper we prove that the class of complemented lattices with this property forms a variety and we explicitly state its defining identities. Moreover, we prove that this variety $\mathcal V$ is congruence permutable and regular. Hence every ideal $I$ of some member $\mathbf L$ of $\mathcal V$ is a kernel of some congruence on $\mathbf L$. Finally, we determine a finite basis of so-called ideal terms and describe the congruence $\varTheta _{I}$ determined by the ideal $I$.

Abstract Quantum mechanics, initially formalized with orthomodular lattices, benefits from a simpler approach using just partially ordered sets (posets). This paper explores how logical connectives are introduced in poset-based logics. Building on prior work by the authors, we delve deeper into ‘dynamic’ logics where truth values can change over time. We consider time sets with a preference relation and propositions whose truth depends on time. Tense operators, introduced by J.Burgess and extended for various logics, become a valuable tool. This paper proposes several approaches to this topic, aiming to inspire a further stream of research.

Abstract The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping $$^+$$ + assigning to each element a the set $$a^+$$ a + of all its complements is investigated as an operator on the given lattice. We can extend the definition of $$a^+$$ a + in a natural way from elements to arbitrary subsets. In particular we study the set $$a^+$$ a + for complemented modular lattices, and we characterize when the set $$a^{++}$$ a + + is a singleton. By means of the operator $$^+$$ + we introduce two other operators $$\rightarrow $$ → and $$\odot $$ ⊙ which can be considered as implication and conjunction in a certain propositional calculus, respectively. These two logical connectives are “unsharp” which means that they assign to each pair of elements a non-empty subset. However, also these two derived operators share a lot of properties with the corresponding logical connectives in intuitionistic logic or in the logic of quantum mechanics. In particular, they form an adjoint pair. Finally, we define so-called deductive systems and we show their relationship to the mentioned operators as well as to lattice filters.

Abstract We study ideals and filters of posets and of pseudocomplemented posets and show a version of the Separation Theorem, known for ideals and filters in lattices and semilattices, within this general setting. We extend the concept of a $$*$$ -ideal already introduced by Rao for pseudocomplemented distributive lattices and by Talukder, Chakraborty and Begum for pseudocomplemented semilattices to pseudocomplemented posets. We derive several important properties of such ideals. Especially, we explain connections between prime filters, ultrafilters, filters satisfying the $$*$$ -condition and dense elements. Finally, we prove a Separation Theorem for $$*$$ -ideals.

We show that for every orthomodular poset P=(P,≤,′,0,1) 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 operator residuated poset corresponding to P from which the original orthomodular poset P can be recovered. We show that this construction of operators can be applied also to so-called weakly orthomodular and dually weakly orthomodular posets. Examples of such posets are included.

Abstract In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g. (generalized) orthomodular lattices, and MV-algebras, which admit a natural notion of implication. In fact, it turns out that skew Hilbert algebras play a similar role for (strongly) sectionally pseudocomplemented posets as Hilbert algebras do for relatively pseudocomplemented ones. We will discuss basic properties of closed, dense and weakly dense elements of skew Hilbert algebras and their applications, and we will provide some basic results on their structure theory.

Abstract The concept of a Sheffer operation known for Boolean algebras and orthomodular lattices is extended to arbitrary directed relational systems with involution. It is proved that to every such relational system, there can be assigned a Sheffer groupoid and also, conversely, every Sheffer groupoid induces a directed relational system with involution. Hence, investigations of these relational systems can be transformed to the treatment of special groupoids which form a variety of algebras. If the Sheffer operation is also commutative, then the induced binary relation is antisymmetric. Moreover, commutative Sheffer groupoids form a congruence distributive variety. We characterize symmetry, antisymmetry and transitivity of binary relations by identities and quasi-identities satisfied by an assigned Sheffer operation. The concepts of twist products of relational systems and of Kleene relational systems are introduced. We prove that every directed relational system can be embedded into a directed relational system with involution via the twist product construction. If the relation in question is even transitive, then the directed relational system can be embedded into a Kleene relational system. Any Sheffer operation assigned to a directed relational system $${\mathbf {A}}$$ A with involution induces a Sheffer operation assigned to the twist product of $${\mathbf {A}}$$ A .

Abstract It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced so-called sectionally pseudocomplemented lattices, i.e. lattices with top element 1 where for every elementythe interval [y, 1], the so called section, is pseudocomplemented. We extend this concept to posets with top element. Our goal is to show that such a poset can be considered as an algebraic semantics for a certain kind of more general intuitionistic logic provided an implication is introduced as shown in the paper. We prove some properties of such an implication. This implication is “unsharp” in the sense that the value for given entries need not be a unique element, but may be a subset of the poset in question. Using this implication we show that we can even recover the order of the original poset. Further, a new “unsharp” operator $$\odot $$ ⊙ of conjunction can be introduced which is adjoint to “unsharp” implication and hence we obtain an “unsharp” residuated poset.

Together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that-similar to relatively pseudocomplemented lattices-these structures can serve as an algebraic semantics of certain intuitionistic logics. The aim of the present paper is to define congruences and filters in these structures, derive mutual relationships between them and describe basic properties of congruences in strongly sectionally pseudocomplemented posets. For the description of filters in both sectionally pseudocomplemented lattices and posets, we use the tools introduced by A. Ursini, i.e., ideal terms and the closedness with respect to them. It seems to be of some interest that a similar machinery can be applied also for strongly sectionally pseudocomplemented posets in spite of the fact that the corresponding ideal terms are not everywhere defined.

Abstract We introduce so-called consistent posets which are bounded posets with an antitone involution $$'$$ ′ where the lower cones of $$x,x'$$ x,x′ and of $$y,y'$$ y,y′ coincide provided thatx, yare different from 0, 1 and, moreover, ifx, yare different from 0, then their lower cone is different from 0, too. We show that these posets can be represented by means of commutative meet-directoids with an antitone involution satisfying certain identities and implications. In the case of a finite distributive or strongly modular consistent poset, this poset can be converted into a residuated structure and hence it can serve as an algebraic semantics of a certain non-classical logic with unsharp conjunction and implication. Finally we show that the Dedekind–MacNeille completion of a consistent poset is a consistent lattice, i.e., a bounded lattice with an antitone involution satisfying the above-mentioned properties.

Abstract In this paper, we consider a generalization of the notion of orthomodularity for posets to the concept of the generalized orthomodularity property (GO-property) by considering the $LU$-operators. This seemingly mild generalization of orthomodular posets and its order theoretical analysis yield rather strong application to effect algebras and orthomodular structures. Also, for several classes of orthoalgebras, the GO-property yields a completely order-theoretical characterization of the coherence law, and, in turn, of proper orthoalgebras.

Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation $\mathrel \Delta$ and a binary operator $d(x,y)$ that are generalizations of the binary relation $\textrm{C}$ and the commutator $c(x,y)$, respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations $\mathrel \Delta$ and $\leftrightarrow$ (the latter was introduced by P. Pták and S. Pulmannová) and the operator $d(x,y)$. In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of $\Delta$-blocks with respect to Boolean subalgebras and distributive subposets they include.

Abstract Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras $${\mathbf {E}}$$ E , we investigate a natural implication and prove that the implication reduct of $${\mathbf {E}}$$ E is term equivalent to $${\mathbf {E}}$$ E . Then, we present a simple axiom system in Gentzen style in order to axiomatize the logic induced by lattice effect algebras. For effect algebras which need not be lattice-ordered, we introduce a certain kind of implication which is everywhere defined but whose result need not be a single element. Then, we study effect implication algebras and prove the correspondence between these algebras and effect algebras satisfying the ascending chain condition. We present an axiom system in Gentzen style also for not necessarily lattice-ordered effect algebras and prove that it is an algebraic semantics for the logic induced by finite effect algebras.

Abstract In a previous paper, the authors defined two binary term operations in orthomodular lattices such that an orthomodular lattice can be organized by means of them into a left residuated lattice. It is a natural question if these operations serve in this way also for more general lattices than the orthomodular ones. In our present paper, we involve two conditions formulated as simple identities in two variables under which this is really the case. Hence, we obtain a variety of lattices with a unary operation which contains exactly those lattices with a unary operation which can be converted into a left residuated lattice by use of the above mentioned operations. It turns out that every lattice in this variety is in fact a bounded one and the unary operation is a complementation. Finally, we use a similar technique by using simpler terms and identities motivated by Boolean algebras.

The so-called non-associative MV-algebras were introduced recently by the first author and J. Kühr in order to have an appropriate tool for certain logics used in expert systems where associativity of the binary operation is excluded, see, e.g., Botur and Halaš (Arch Math Log 48:243-255, 2009). Since implication is an important logical connective in practically every propositional logic, in the present paper we investigate the implication reducts of non-associative MV-algebras. We also determine their structures based on the underlying posets. The natural question when a poset with the greatest element equipped with sectional switching involutions can be organized into an implication NMV-algebra is solved. Moreover, congruence properties of the variety of implication NMV-algebras with, respectively, without zero are investigated. Analogously to classical propositional logic, we introduce a certain kind of Sheffer operation and we obtain a one-to-one correspondence between NMV-algebras and certain algebras built up by a Sheffer-like operation together with a unary operation.

For finite m and q we study the lattice $$\mathbf {L}(\mathbf {V})=(L(\mathbf {V}),+,\cap ,\{\vec {0}\},V)$$ of subspaces of an m-dimensional vector space $$\mathbf {V}$$ over a field $$\mathbf {K}$$ of cardinality q. We present formulas for the number of d-dimensional subspaces of $$\mathbf {V}$$ , for the number of complements of a subspace and for the number of e-dimensional subspaces including a given d-dimensional subspace. It was shown in Eckmann and Zabey (Helv Phys Acta 42:420–424, 1969) that $$\mathbf {L}(\mathbf {V})$$ possesses an orthocomplementation only in case $$m=2$$ and $${{\,\mathrm{char}\,}}\mathbf {K}\ne 2$$ . Hence, only in this case $$\mathbf {L}(\mathbf {V})$$ can be considered as an orthomodular lattice. On the contrary, we show that a complementation $$'$$ on $$\mathbf {L}(\mathbf {V})$$ can be chosen in such a way that $$(L(\mathbf {V}),+,\cap ,{}')$$ is both weakly orthomodular and dually weakly orthomodular. Moreover, we show that $$(L(\mathbf {V}),+,\cap ,{}^\perp ,\{\vec {0}\},V)$$ is paraorthomodular in the sense of Giuntini et al. (Stud Log 104:1145–1177, 2016).

We study conditions under which the lattice $${{\mathrm{\mathbf {Id}}}}\mathbf R$$ of ideals of a given a commutative semiring $${\mathbf {R}}$$ is complemented. At first we check when the annihilator $$I^*$$ of a given ideal I of $${\mathbf {R}}$$ is a complement of I. Further, we study complements of annihilator ideals. Next we investigate so-called Łukasiewicz semirings. These form a counterpart to MV-algebras which are used in quantum structures as they form an algebraic semantic of many-valued logics as well as of the logic of quantum mechanics. We describe ideals and congruence kernels of these semirings with involution. Finally, using finite unitary Boolean rings, a construction of commutative semirings with complemented lattice of ideals is presented.

The concept of operator left residuation has been introduced by the authors in their previous paper (Chajda and Länger in Asian Eur J Math 11:1850097, 2018). Modifications of so-called quantum structures, in particular orthomodular posets, like pseudo-orthomodular, pseudo-Boolean and Boolean posets are investigated here in order to show that they are operator left residuated or even operator residuated. In fact, they satisfy more general sufficient conditions for operator residuation assumed for bounded posets equipped with a unary operation. It is shown that these conditions may be also necessary if a generalized version using subsets instead of single elements is considered. The above-listed posets can serve as an algebraic semantics for the logic of quantum mechanics in a broad sense. Moreover, our approach shows connections to substructural logics via the considered residuation.

Generalized Boolean quasirings are ring-like structures used as algebraic models in the foundations of axiomatic quantum mechanics. The quantum mechanical system corresponding to such a quasiring turns out to be a classical one if and only if this quasiring is a Boolean ring with unit. We characterize this situation by a single identity.

For an algebra $${\mathbf {A}}$$ belonging to a quasivariety $${\mathcal {K}}$$ , the quotient $${\mathbf {A}}/\Theta $$ need not belong to $${\mathcal {K}}$$ for every $$\Theta \in {{\mathrm{Con}}}~{\mathbf {A}}$$ . The natural question arises for which $$\Theta \in {{\mathrm{Con}}}~{\mathbf {A}}, {\mathbf {A}}/\Theta \in {\mathcal {K}}$$ . We consider algebras $${\mathbf {A}}=(A,\rightarrow ,1)$$ of type (2, 0) where a partial order relation is determined by the operations $$\rightarrow $$ and 1. Within these, we characterize congruences on $${\mathbf {A}}$$ for which $${\mathbf {A}}/\Theta $$ belongs to the same quasivariety as $${\mathbf {A}}$$ . In several particular cases, these congruences are determined by the property that every class is a convex subset of A.