Search

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 a previous paper 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 V is congruence permutable and regular. Hence every ideal I of some member L of V is a kernel of some congruence on L. Finally, we determine a finite basis of so-called ideal terms and describe the congruence $\Theta_I$ determined by the ideal I.

The Sasaki projection and its dual were introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. In a previous paper the authors showed that the Sasaki operations induced by the Sasaki projection and its dual form an adjoint pair in every orthomodular lattice. Later on the authors described large classes of algebras in which Sasaki operations can be defined and form an adjoint pair. The aim of the present paper is to extend these investigations to bounded posets with a unary operation. We introduce the so-called generalized Sasaki projection and its dual as well as the so-called generalized Sasaki operations induced by them. When treating these projections and operations we consider only so-called saturated posets, i.e. posets having the property that above any lower bound of two elements there is at least one maximal lower bound and below any upper bound of two elements there is at least one minimal upper bound. We prove that the generalized Sasaki operations are well-defined if and only if the poset in question is orthogonal. We characterize adjointness of the generalized Sasaki operations in different ways and show that adjointness is possible only if the unary operation is a complementation. Finally, we prove that in every saturated orthomodular poset the generalized Sasaki operations form an adjoint pair.

We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner product, orthogonal elements, orthogonal subsets, bases and closed subquasimodules. We show that the set of all closed subquasimodules forms a complete lattice having orthogonality as an antitone involution. Using the Galois connection induced by this orthogonality, we describe important properties of closed subquasimodules. We call a subquasimodule P of a quasimodule Q splitting if the sum of P and its orthogonal companion is the whole set Q and the intersection of P and its orthogonal companion is trivial. We show that every splitting subquasimodule is closed and that its orthogonal companion is splitting, too. Our results are illuminated by several examples.

By the operator of relative complementation is meant a mapping assigning to every element x of an interval [a,b] of a lattice L the set x^{ab} of all relative complements of x in [a,b]. Of course, if L is relatively complemented then x^{ab} is non-empty for each interval [a,b] and every element x belonging to it. We study the question under what condition a complement of x in L induces a relative complement of x in [a,b] It is well-known that this is the case provided L is modular and complemented. However, we present a more general result. Further, we investigate properties of the operator of relative complementation, in particular in the case when the interval [a,b] is a modular sublattice of L or if it is finite. Moreover, we characterize when the operator of relative complementation is involutive and we show a class of lattices where this identity holds. Finally, we establish sufficient conditions under which two different complements of a given element x of [a,b] induce the same relative complement of x in this interval.

The so-called Sasaki projection was introduced by U. Sasaki on the lattice L(H) of closed linear subspaces of a Hilbert space H as a projection of L(H) onto a certain sublattice of L(H). Since L(H) is an orthomodular lattice, the Sasaki projection and its dual can serve as the logical connectives conjunction and implication within the logic of quantum mechanics. It was shown by the authors in a previous paper that these operations form a so-called adjoint pair. The natural question arises if this result can be extended also to lattices with a unary operation which need not be orthomodular or to other algebras with two binary and one unary operation. To show that this is possible is the aim of the present paper. We determine a variety of lattices with a unary operation where the Sasaki operations form an adjoint pair and we continue with so-called $\lambda$-lattices and certain classes of semirings. We show that the Sasaki operations have a deeper sense than originally assumed by their author and can be applied also outside the lattices of closed linear subspaces of a Hilbert space.

Not all logical systems can be captured using algebras. We see this in classical logic (formalized by Boolean algebras) and many-valued logics (like Lukasiewicz logic with MV-algebras). Even 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.

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^+$ of all its complements is investigated as an operator on the given lattice. We can extend the definition of $a^+$ in a natural way from elements to arbitrary subsets. In particular we study the set $a^+$ for complemented modular lattices, and we characterize when the set $a^{++}$ is a singleton. By means of the operator $^+$ we introduce two other operators $\to$ 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.

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 algebra. If S is a pseudocomplemented lattice, this orthogonality relation can be defined by means of the pseudocomplementation. Finally, we show that if S is a complete pseudocomplemented lattice then Cl(S) is a complete Boolean algebra. For pseudocomplemented posets a similar result holds if the subset of pseudocomplements forms a complete lattice satisfying a certain compatibility condition.

Tolerance relations were investigated by several authors in various algebraic structures, see e.g. the monograph by I. Chajda. Recently G. Cz\'edli studied so-called 2-uniform tolerances on lattices, i.e. tolerances that are compatible with the lattice operations and whose blocks are of cardinality 2. He showed that two such tolerances on a lattice containing no infinite chain permute if and only if they are amicable (a concept introduced in his paper). We extend this study to tolerances on posets. Since in posets we have no lattice operations, we must modify the notion of amicability. We modified it in such a way that in case of lattices it coincides with the original definition. With this new definition we can prove that two tolerances on a poset containing no infinite chain permute if and only if they are amicable in the new sense.

Two kinds of the connective implication are introduced as term operations of a pseudocomplemented lattice. It is shown that they share a lot of properties with the intuitionistic implication based on Heyting algebras. In particular, if the pseudocomplemented lattice in question is a Stone lattice then the considered implications satisfy some kind of quasi-commutativity, of the exchange property, some version of adjointness with the meet-operation and some kind of the derivation rule Modus Ponens and of the contraposition law. Two kinds of deductive systems are defined and their elementary properties are shown. All investigated concepts are illuminated by examples.

Investigating the structure of pseudocomplemented lattices started ninety years ago with papers by V. Glivenko, G. Birkhoff and O. Frink and this structure was essentially developed by G. Gr\"atzer. In recent years, some special filters in pseudocomplemented and Stone lattices have been studied by M. Sambasiva Rao. However, in some applications, in particular in non-classical logics with unsharp logical connectives, pseudocomplemented posets instead of lattices are used. This motivated us to develop an algebraic theory of pseudocomplemented posets, i.e. we derive identities and inequalities holding in such posets and we use them in order to characterize the so-called Stone posets. Then we adopt several concepts of special filters and we investigate their properties in pseudocomplemented posets. Moreover, we show how properties of these filters influence algebraic properties of the underlying pseudocomplemented posets.

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is relatively pseudocomplemented. The considered logical connectives negation, implication or even conjunction are not operations in this poset but so-called operators since they assign to given entries not necessarily an element of the poset as a result but a subset of mutually incomparable elements with maximal possible truth values. We show that these operators for negation and implication can be characterized by several simple conditions formulated in the language of posets together with the operator of taking the lower cone. Moreover, our implication and conjunction form an adjoint pair. We call these connectives "unsharp" or "inexact" in accordance with the existing literature. We also introduce the concept of a deductive system of a bounded poset with implication and prove that it induces an equivalence relation satisfying a certain substitution property with respect to implication. Moreover, the restriction of this equivalence on the base set is uniquely determined by its kernel, i.e. the class containing the top element.

M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a certain modification of the notion of a pseudocomplement as the set of all maximal elements belonging to the annihilator of the corresponding element. We prove several basic properties of this notion and then define coherent, closed and median filters as well as D-filters. In order to be able to obtain valuable results we often must add some additional assumptions on the underlying lattice, e.g. that this lattice is Stonean or D-Stonean. Our results relate properties of lattices and of corresponding filters. We show how the structure of a lattice influences the form of its filters and vice versa.

Effect algebras were introduced in order to describe the structure of effects, i.e. events in quantum mechanics. They are partial algebras describing the logic behind the corresponding events. It is natural to ask how to introduce the logical connective implication in effect algebras. For lattice-ordered effect algebras this task was already solved by several authors, including the present ones. We concentrate on effect algebras that need not be lattice-ordered since these can better describe the events occurring in the quantum physical system. Although an effect algebra is only partial, we try to find a logical connective implication which is everywhere defined. But such a connective can be "unsharp" or "inexact" because its outputs for given pairs of entries need not be elements of the underlying effect algebra, but may be subsets of (mutually incomparable) maximal elements. We introduce such an implication together with its adjoint functor representing conjunction. Then we consider so-called tense operators on effect algebras. Of course, also these operators turn out to be "unsharp" in the aforementioned sense, but they are in a certain relation with the operators implication and conjunction. Finally, for given tense operators and given time set T, we describe two methods how to construct a time preference relation R on T such that the given tense operators are either comparable with or equivalent to those induced by the time frame (T,R).

In this paper we show that several classes of partially ordered structures having paraorthomodular reducts, or whose sections may be regarded as paraorthomodular posets, admit a quite natural notion of implication, that admits a suitable notion of adjointness. Within this framework, we propose a smooth generalization of celebrated Greechie's theorems on amalgams of finite Boolean algebras to the realm of Kleene lattices.

A class of ring-like event systems (RLSEs) is studied that generalizes Boolean rings. Quantum logics represented by orthomodular lattices are characterized within this class and the correspondence between Boolean algebras and Boolean rings is enlarged to orthomodular lattices. The structure of RLSEs and various subclasses is analysed and classical logics are especially identified. Moreover, sets of numerical events within different contexts of physical problems are described. A numerical event is defined as a function p from a set S of states of a physical system to [0,1] such that p(s) is the probability of the occurrence of an event when the system is in state s\in S. In particular, the question is answered whether a given (small) set of numerical events will give rise to the assumption that one deals with a classical physical system or a quantum mechanical one.

It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement and conjunction is the semilattice operation meet. If the Brouwerian semilattice has a bottom element 0 then the relative pseudocomplement with respect to 0 is called the pseudocomplement and it is considered as the connective negation in this logic. Our idea is to consider an arbitrary meet-semilattice with 0 satisfying only the Ascending Chain Condition, which is trivially satisfied in finite semilattices, and introduce the connective negation x^0 as the set of all maximal elements z satisfying x^z=0 and the connective implication x->y as the set of all maximal elements z satisfying x^z\le y. Such a negation and implication is "unsharp" since it assigns to one entry x or to two entries x and y belonging to the semilattice, respectively, a subset instead of an element of the semilattice. Surprisingly, this kind of negation and implication, respectively, still shares a number of properties of these connectives in intuitionistic logic, in particular the derivation rule Modus Ponens. Moreover, unsharp negation and unsharp implication can be characterized by means of five, respectively seven simple axioms. Several examples are presented. The concepts of a deductive system and of a filter are introduced as well as the congruence determined by such a filter. We finally describe certain relationships between these concepts.

Similarly as classical propositional calculus is based algebraically on Boolean algebras, the logic of quantum mechanics was based on orthomodular lattices by G. Birkhoff and J. von Neumann and K. Husimi. However, this logic does not incorporate time dimension although it is apparent that the propositions occurring in the logic of quantum mechanics are depending on time. The aim of the present paper is to show that so-called tense operators can be introduced also in such a logic for given time set and given time preference relation. In this case we can introduce these operators in a purely algebraic way. We derive several important properties of such operators, in particular we show that they form dynamic pairs and, altogether, a dynamic algebra. We investigate connections of these operators with logical connectives conjunction and implication derived from Sasaki projections. Then we solve the converse problem, namely to find for given time set and given tense operators a time preference relation in order that the resulting time frame induces the given operators. We show that the given operators can be obtained as restrictions of operators induced by a suitable extended time frame.

We prove that the 18-element non-lattice orthomodular poset depicted in the paper is the smallest one and unique up to isomorphism. Since not every Boolean poset is orthomodular, we consider the class of the so-called generalized orthomodular posets introduced by the first and third author in a previous paper. We show that this class contains all Boolean posets and we study its subclass consisting of horizontal sums of Boolean posets. For this purpose we introduce the concept of a compatibility relation and the so-called commutator of two elements. We show the relationship between these concepts and we introduce the notion of a ternary discriminator for these posets. Numerous examples illuminating these concepts and results are included in the paper.

It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators on such a logic in an inexact way, but still satisfying requirements asked on tense operators in the classical logic based on Boolean algebras or in various non-classical logics. Our construction of tense operators works perfectly when the orthomodular poset in question is finite. We investigate the behaviour of these tense operators, e.g. we show that some of them form a dynamic pair. Moreover, we prove that if the tense operators preserve one of the inexact connectives conjunction or implication as defined by the authors recently in another paper, then they also preserve the other one. Finally, we show how to construct the binary relation of time preference on a given time set provided the tense operators are given, up to equivalence induced by natural quasiorders.

Weakly orthomodular and dually weakly orthomodular lattices were introduced by the authors in a recent paper. Similarly as for orthomodular lattices we try to introduce an implication in these lattices which can be easily axiomatized and which yields a nice lattice structure. As shown in the paper, this can be realized in several different ways. Moreover, we reveal the connection of weakly and dually weakly orthomodular lattices to residuated structures. Moreover, we provide a characterization of these lattices by means of certain generalized measures.

In their recent paper on posets with a pseudocomplementation denoted by * the first and the third author introduced the concept of a *-ideal. This concept is in fact an extension of a similar concept introduced in distributive pseudocomplemented lattices and semilattices by several authors, see References. Now we apply this concept of a c-ideal (dually, c-filter) to complemented posets where the complementation need neither be antitone nor an involution, but still satisfies some weak conditions. We show when an ideal or filter in such a poset is a c-ideal or c-filter, respectively, and we prove basic properties of them. Finally, we prove so-called Separation Theorems for c-ideals. The text is illustrated by several examples.

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 operator residuated poset corresponding to P from which the original orthomodular poset P can be recovered. Moreover, this correspondence is almost one-to-one. 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.

We study algebras and varieties where every non-trivial congruence has some class being a non-trivial subuniverse of the algebra in question. Then we focus on algebras where this non-trivial class is a unique non-singleton class of the congruence. In particular, we investigate Rees algebras, quasi-Rees algebras and algebras having the one-block-property. We also present results concerning these properties on quotient algebras. Several examples of such algebras and varieties are included.

The Second Quantum Revolution facilitates the engineering of new classes of sensors, communication technologies, and computers with unprecedented capabilities. Supply chains for quantum technologies are emerging, some focussed on commercially available components for enabling technologies and/or quantum-technologies research infrastructures, others with already higher technology-readiness levels, near to the market. In 2018, the European Commission has launched its large-scale and long-term Quantum Flagship research initiative to support and foster the creation and development of a competitive European quantum technologies industry, as well as the consolidation and expansion of leadership and excellence in European quantum technology research. One of the measures to achieve an accelerated development and uptake has been identified by the Quantum Flagship in its Strategic Research Agenda: the promotion of coordinated, dedicated standardisation and certification efforts. Standardisation is indeed of paramount importance to facilitate the growth of new technologies, and the development of efficient and effective supply chains. The harmonisation of technologies, methodologies, and interfaces enables interoperable products, innovation, and competition, all leading to structuring and hence growth of markets. As quantum technologies are maturing, time has come to start thinking about further standardisation needs. This article presents insights on standardisation for quantum technologies from the perspective of the CEN-CENELEC Focus Group on Quantum Technologies (FGQT), which was established in June 2020 to coordinate and support the development of standards relevant for European industry and research.

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.

For a partial lattice L the so-called two-point extension is defined in order to extend L to a lattice. We are motivated by the fact that the one-point extension broadly used for partial algebras does not work in this case, i.e. the one-point extension of a partial lattice need not be a lattice. We describe these two-point extensions and prove several properties of them. We introduce the concept of a congruence on a partial lattice and show its relationship to the notion of a homomorphism and its connections with congruences on the corresponding two-point extension. In particular we prove that the quotient L/E of a partial lattice L by a congruence E on L is again a partial lattice and that the two-point extension of L/E is isomorphic to the quotient lattice of the two-point extension L* of L by the congruence on L* generated by E. Several illustrative examples are enclosed.

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventieth of the twentieth century by B. Zelinka and the first author. Since tolerances need not be transitive, their blocks may overlap and hence in general the set of all blocks of a tolerance cannot be converted into a quotient algebra in the same way as in the case of congruences. However, G. Cz\'edli showed that lattices can be factorized by means of tolerances in a natural way, and J. Grygiel and S. Radelecki proved some variant of an Isomorphism Theorem for tolerances on lattices. The aim of the present paper is to extend the concept of a tolerance on a lattice to posets in such a way that results similar to those obtained for tolerances on lattices can be derived.

A Kleene lattice is a distributive lattice equipped with an antitone involution and satisfying the so-called normality condition. These lattices were introduced by J. A. Kalman. We extended this concept also for posets with an antitone involution. In our recent paper [5], we showed how to construct such Kleene lattices or Kleene posets from a given distributive lattice or poset and a fixed element of this lattice or poset by using the so-called twist product construction, respectively. We extend this construction of Kleene lattices and Kleene posets by considering a fixed subset instead of a fixed element. Moreover, we show that in some cases, this generating poset can be embedded into the resulting Kleene poset. We investigate the question when a Kleene poset can be represented by a Kleene poset obtained by the mentioned construction. We show that a direct product of representable Kleene posets is again representable and hence a direct product of finite chains is representable. This does not hold in general for subdirect products, but we show some examples where it holds. We present large classes of representable and non-representable Kleene posets. Finally, we investigate two kinds of extensions of a distributive poset A, namely its Dedekind-MacNeille completion DM(A) and a completion G(A) which coincides with DM(A) provided A is finite. In particular we prove that if A is a Kleene poset then its extension G(A) is also a Kleene lattice. If the subset X of principal order ideals of A is involutionclosed and doubly dense in G(A) then it generates G(A) and it is isomorphic to A itself.

It is well-known that to every binary relation on a non-void set I there can be assigned its incidence matrix, also in the case when I is infinite. We show that a certain kind of "multiplication" of such incidence matrices corresponds to the composition of the corresponding relations. Using this fact we investigate the solvability of the equation R o X = S for given binary relations R and S on I and derive an algorithm for solving this equation by using the connections between the corresponding incidence matrices. Moreover, we describe how one can obtain the incidence matrix of a product of binary relations from the incidence matrices of its factors.

We present an easy construction producing a Kleene lattice K from an arbitrary distributive lattice L and a non-empty subset of L. We show that L can be embedded into K and compute the cardinality of K under certain additional assumptions. We prove that every finite chain considered as a Kleene lattice can be represented in this way and that this construction preserves direct products.Moreover, we demonstrate that certain Kleene lattices that are ordinal sums of distributive lattices are representable. Finally, we prove that not every Kleene lattice is representable.

The concept of integral as an inverse to that of derivation was already introduced for rings and recently also for lattices. Since semirings generalize both rings and bounded distributive lattices, it is natural to investigate integration in semirings. This is our aim in the present paper. We show properties of such integrals from the point of view of semiring operations. Examples of semirings with derivation where integrals are introduced are presented in the paper. These illuminate rather specific properties of such integrals. We show when the set of all integrals on a given semiring forms a semiring again.

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 element y the 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. On the other hand, all of these values are as high as possible. We show that this implication even determines the poset and if a new operator \odot is introduced in an "unsharp" way, such structure forms an "unsharply" residuated poset.

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of L can be replaced by a weaker one formulated in the language of so-called modular triples. We further show that, in general, we need not suppose that x has a complement in L. By introducing the concept of modular triples in posets, we extend our results obtained for lattices to posets. It should be remarked that the notion of a complement can be introduced also in posets that are not bounded.

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, their applications, and we will provide some basic results on their structure theory.

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective implication in a certain kind of intuitionistic logic. Contrary to the case of Brouwerian semilattices, sections need not be distributive lattices. This essentially allows possible applications in non-classical logics. We present a connection of the semilattices mentioned in the beginning with so-called non-classical implication semilattices which can be converted into I-algebras having everywhere defined operations. Moreover, we relate our structures to sectionally and relatively residuated semilattices which means that our logical structures are closely connected with substructural logics. We show that I-algebras form a congruence distributive, 3-permutable and weakly regular variety.

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra (based on a commutative directoid or on a lambda-lattice) which satisfies certain identities and implications. We show that the assigned algebras fully characterize the given corresponding posets. It turns out that the assigned algebras satisfy strong congruence properties which can be transferred back to the posets. We also mention applications of such posets in certain non-classical logics.

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined by two elements and investigate when these are strictly monotone or upper cone preserving. If the considered poset is a semilattice then its monotone mappings coincide with semilattice homomorphisms if and only if the poset is a chain. Similarly, we study posets which need not be semilattices but whose upper cones have a minimal element. We extend this investigation to posets that are direct products of chains or an ordinal sum of an antichain and a finite chain. We characterize equivalence relations induced by strongly monotone mappings and show that the quotient set of a poset by such an equivalence relation is a poset again.

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 treaty 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 symmertry, antisymmetry and treansitivity 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 A with involution induces a Sheffer operation assigned to the twist-product of A.

Given an integral commutative residuated lattice L=(L,\vee,\wedge), its full twist-product (L^2,\sqcup,\sqcap) can be endowed with two binary operations \odot and \Rightarrow introduced formerly by M. Busaniche and R. Cignoli as well as by C. Tsinakis and A. M. Wille such that it becomes a commutative residuated lattice. For every a in L we define a certain subset P_a(L) of L^2. We characterize when P_a(L) is a sublattice of the full twist-product (L^2,\sqcup,\sqcap). In this case P_a(L) together with some natural antitone involution ' becomes a pseudo-Kleene lattice. If L is distributive then (P_a(L),\sqcup,\sqcap,') becomes a Kleene lattice. We present sufficient conditions for P_a(L) being a subalgebra of (L^2,\sqcup,\sqcap,\odot,\Rightarrow) and thus for \odot and \Rightarrow being a pair of adjoint operations on P_a(L). Finally, we introduce another pair \odot and \Rightarrow of adjoint operations on the full twist-product of a bounded commutative residuated lattice such that the resulting algebra is a bounded commutative residuated lattice satisfying the double negation law and we investigate when P_a(L) is closed under these new operations \odot and \Rightarrow.

Synthesis of organic bi-layers on silicon was realized by a combination of surface functionalization under ultra-high vacuum (UHV) conditions and solution-based click chemistry. The silicon (001) surface was prepared with a high degree of perfection in UHV and functionalized via chemoselective adsorption of ethinyl cyclopropyl cyclooctyne from the gas phase. A second organic layer was then coupled in acetonitrile via the copper-catalyzed alkyne azide click reaction. The samples were directly transferred from UHV via the vapour phase of the solvent into the solution of reactants and back to UHV without contact to ambient conditions. Each reaction step was monitored by means of X-ray photoelectron spectroscopy in UHV; the N 1s spectra clearly indicated the click reaction of the azide group in the two test molecules employed, i.e., methyl-subsituted benzylazide and azide substituted pyrene. In both cases, up to 50 - 60 % of the ethinyl cyclopropyl cyclooctyne molecules on the surface were reacted.

The additive-free tetrazine/enol ether click reaction was performed in ultra-high vacuum (UHV) with an enol ether group covalently linked to a silicon surface: Dimethyl 1,2,4,5-tetrazine-3,6-dicarboxylate molecules were coupled to the enol ether group of a functionalized cyclooctyne which was adsorbed on the silicon (001) surface via the strained triple bond of cyclooctyne. The reaction was observed at a surface temperature of 380 K by means of X-ray photoelectron spectroscopy (XPS). No indications for tetrazine molecules which bind directly to the Si(001) surface via the nitrogen atoms were detected. A moderate energy barrier was deduced for this click reaction in vacuum by means of density functional theory based calculations, in good agreement with the experimental results. This UHV-compatible click reaction thus opens a new, flexible route for synthesizing covalently bound organic architectures.

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 left-residuated groupoids which need not be lattice-ordered. Hence, for the full twist product we cannot use the same construction. We present another appropriate construction which, however, does not preserve commutativity and associativity of multiplication. Hence we introduce so-called operator residuated posets to obtain another construction which preserves the mentioned properties, but the results of operators on the full twist product need not be elements, but may be subsets. We apply this construction also to restricted twist products and present necessary and sufficient conditions under which we obtain a pseudo-Kleene operator residuated poset.

Paraorthomodular posets are bounded partially ordered set with an antitone involution induced by quantum structures arising from the logico-algebraic approach to quantum mechanics. The aim of the present work is starting a systematic inquiry into paraorthomodular posets theory both from an algebraic and order-theoretic perspective. On the one hand, we show that paraorthomodular posets are amenable of an algebraic treatment by means of a smooth representation in terms of bounded directoids with antitone involution. On the other, we investigate their order-theoretical features in terms of forbidden configurations. Moreover, sufficient and necessary conditions characterizing bounded posets with an antitone involution whose Dedekind-MacNeille completion is paraorthomodular are provided.