Sheffer operation in relational systems

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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {A}}$$\end{document}A with involution induces a Sheffer operation assigned to the twist product of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbf {A}}$$\end{document}A.


Introduction
Relational systems form one of the most general mathematical structures. Almost all structures appearing in algebra can be considered as relational structures. Such structures were studied for a long lime, see the pioneering work by Riguet (1948) containing elementary properties and constructions with binary relations and the paper by Fraissé (1954). On the other hand, in contrast to publications in algebra, not so many of papers are devoted to relational systems. One of the reasons is that there are not so powerful tools for investigating relations as there are for algebras. This is also the reason why relational systems do not appear so often in applications The authors introduced formerly several methods where relational systems are connected with various accompanying algebras, and hence their properties can be transformed into algebraic language, and the problems are solved by tools developed in general algebra. Let us mention, e.g.,  and Chajda and Länger (2016a) where certain groupoids similar to directoids are assigned to a relational system. In Chajda and Länger (2016b) and Chajda et al. (2015), this approach is applied to relational systems equipped with a unary operation. For ternary relations, such an approach was used in . In Bonzio and Chajda (2018), relational systems are treated similarly as residuated posets. This is important because residuated posets serve as an algebraic semantics of a certain kind of substructural logic, see (Chajda and Länger 2021), and hence also the considered relational systems can play a similar role in a more general setting.
In the present paper, we extend this list of used tools by the so-called Sheffer operation. Remember that the Sheffer operation introduced by Sheffer (1913) was used in Boolean algebras as a very successful tool since this operation can replace all other Boolean operations. Namely, every Boolean operation, both basic or derived, can be expressed by repeatedly using the Sheffer operation, see e.g., (Birkhoff 1979). In today terminology, the clone of Boolean functions is generated by the Sheffer operation. This has a surprising and very successful application in technology because in switching circles in particular in computer processors, it suffices to use only one binary operation, namely the Sheffer one. Then the technology of production of such chips is much easier and cheaper than it was in the beginning of computer era when several parts of the computer were composed by at least two different kinds of diodes (e.g., one for conjunction and the other one for negation). As it was shown by the first author in Chajda (2005), a Sheffer operation can be introduced not only in Boolean algebras but also in orthomodular lattices or even in ortholattices (see Birkhoff 1979 for these concepts). These algebras form an algebraic semantics of the logic of quantum mechanics, see e.g., Birkhoff and von Neumann (1936) or Husimi (1937). However, it turns out that such lattices may not model this propositional calculus precisely, see e.g., (Finch 1970). The reason is that in these logics, disjunction does not necessarily exist for all elements, i.e., that supremum of two elements need not exist if these elements are not orthogonal, see Chajda and Kolařík (2014) and Finch (1970). Hence, the so-called orthomodular posets and orthoposets were introduced. This was the reason why the concept of Sheffer operation was transferred from ortholattices to orthomodular posets and orthoposets, or, more generally, to posets with an involution or a complementation, see Chajda and Kolařík (2021).
The next natural step is to extend this method from posets to more general relational systems. In order to avoid difficulties with not everywhere defined operations and some other drawbacks, we consider so-called directed relational systems where the relation is reflexive and equipped with a unary involution operation. The authors show that also in this case, a kind of Sheffer operation can be introduced and the corresponding groupoid characterizes the given relational system. At first, we show that similarly as for Boolean algebras, using an assigned Sheffer operation, we can conversely recover not only the involution, but also the given binary relation.
The goals and benefits of our approach are as follows: • At first, we show that similarly as for Boolean algebras where all the operations can be recovered by means of the Sheffer operation, also here the unary operation and the given binary relation can be reconstructed by means of only one specific Sheffer operation. • We show that some basic properties of binary relations can be characterized by means of identities and quasiidentities in this Sheffer operation and hence one can use a purely algebraic approach to these relational systems.
• Since the class of Sheffer groupoids assigned to the class of relational systems with antitone involution forms a variety, also some important congruence properties can be investigated for relational systems. • We describe connections between homomorphisms of Sheffer groupoids and homomorphisms of assigned relational systems. • We derive Kleene relational systems by using the twist product construction and introduce a Sheffer operation on them in order to be able to apply the above-mentioned tools and results.

Basic concepts
The Sheffer operation was introduced by Sheffer (1913) in Boolean algebras. If B = (B, ∨, ∧, , 0, 1) is a Boolean algebra and one defines then | is just the Sheffer operation on B. At first, we introduce the concept of Sheffer operation in a general setting as follows.

Definition 2.1 A Sheffer operation on a non-void set
A is a binary operation | on A satisfying the following identities: (1) (x|y)|(y|y) ≈ y. (2) A groupoid is an algebra of type (2). A Sheffer groupoid is a groupoid (A, |) where | is a Sheffer operation on A.
Hence, the class of Sheffer groupoids is determined by identities, i.e., it forms a variety.

Example 2.2 If
It is worth noticing that the Sheffer operation in a Boolean algebra satisfies the identities (1) and (2), and hence our new concept is sound.
An antitone involution on a lattice (L, ∨, ∧) is a unary operation on L satisfying It is worth noticing that a Sheffer operation need not be unique, see Lemma 2.3.
The following lemma was shown for ortholattices in Chajda (2005), but it holds also for lattices with antitone involution.
Lemma 2.3 Let (L, ∨, ∧, ) be a lattice with antitone involution. Then, (i) and (ii) hold: (1) and (2) are equivalent to (1) and (2) are equivalent to The question whether one of the identities (1) and (2) implies the other one is answered in the negative by the following lemma. (1) and (2) are independent.

Lemma 2.4 Axioms
Proof If A := {a, b} and the binary operation | on A is defined by x|y := x for all x, y ∈ A, then | satisfies (1), but not (2) then | satisfies (2), but not (1) Let us recall some concepts from theory of relations.
Let A be a non-void set, a, b ∈ A, R a binary relation on A and a unary operation on A. We define and call these sets the upper cone and lower cone of a and b with respect to R, respectively.
Definition 2.6 A directed relational system with involution is an ordered triple (A, R, ) consisting of a non-void set A, a binary relation R on A and a unary operation on A satisfying the following conditions: is an involution on (A, R).

Representation of relational systems by Sheffer groupoids
The following result shows how a Sheffer groupoid is connected with a directed relational system with involution.

For every Sheffer groupoid
(1) implies x ≈ x and that R is reflexive. (1) and (2) can be written in the equivalent form (x|y)|x ≈ x and (x|y)|y ≈ y, respectively. If (a, b) ∈ R, then a |b = b, and hence b|a = (a |b )|a = a , i.e., (b , a ) ∈ R showing that is an involution on (A, R). Since (a |b )|a = a and (a |b )|b = b , we have ((a |b ) , a ), ((a |b ) , b ) ∈ R, and hence (a, a |b ), (b, a |b ) ∈ R, i.e., a |b ∈ U (a, b) which shows U (a, b) = ∅. According to Lemma 2.5, (A, R) is directed.

Example 3.2 Put
is the directed relational system induced by the Sheffer groupoid A from Example 2.2.
In the following, we show that also conversely, to every directed relational system with involution, a Sheffer groupoid can be assigned.
Let A = (A, R, ) be a directed relational system with involution. Define a binary operation | on A as follows: if (x , y ) ∈ R, then x|y := y , and take x|y as an arbitrary element of U (x , y ), otherwise (x, y ∈ A). Then, | will be called an operation assigned to A.

Lemma 3.3 Let A = (A, R, ) be a directed relational system with involution and | a binary operation on A. Then, | is assigned to A if and only if
Proof Let a, b ∈ A. First assume | to be assigned to A. If (a, b) ∈ R, then (a , b ) ∈ R, and hence a |b = b = b. Conversely, assume a |b = b. Then, (a, b) / ∈ R would imply (a , b ) / ∈ R, and hence b = a |b ∈ U (a , b ) = U (a, b) and hence (a, b) ∈ R, a contradiction. Hence, (a, b) ∈ R. This shows (i). If (a , b ) ∈ R, then a|b = b ∈ U (a , b ). Otherwise, a|b ∈ U (a , b ), too. This shows (ii). Conversely, if | satisfies (i) and (ii), then clearly | is assigned to A.
The following lemma follows easily. (A, R, ) is a directed relational system with involution and | an assigned operation, then condition (ii) of Lemma 3.3 is equivalent to (x|y)|(x|y) ∈ L(x, y) for all x, y ∈ A.

Lemma 3.4 If
In the following, we will often use this lemma. Now, we prove the converse of Theorem 3.1.
Remark 3.6 In general, G(A) is not uniquely defined. However, it contains all the information on the directed relational system A with involution. In other words, the given directed relational system with involution can be completely recovered from an assigned Sheffer groupoid, see the following result.
On the other hand, we can show for which pairs of elements a Sheffer operation • assigned to R(A, |) coincides with the Sheffer operation | of a given Sheffer groupoid (A, |).
In fact, • need not coincide with | as can be seen by the following example.

Example 3.9
If | is the Sheffer operation from Example 2.2, then • has the operation table

• a b c d a a x d c b y b d c c a b d c d a b d c,
where x, y ∈ {c, d} since U (a, b) = {c, d} in the induced relational system. Hence, if we take x = d or y = d, then • differs from |.
Theorem 3.7 shows that if we start with a directed relational system A with involution, we consider a Sheffer groupoid G assigned to A, and we construct the directed relational system B with involution induced by G, then B = A. Hence, the Sheffer operation substitutes both the binary relation and the unary operation analogously to the situation for Boolean algebras where the Sheffer operation substitutes all other fundamental operations of the Boolean algebra.

Elementary properties of relations
In the following, we characterize properties of the relation R of a directed relational system A = (A, R, ) with involution by means of identities and quasi-identities for a Sheffer operation assigned to A.

Theorem 4.1 Let A = (A, R, ) be a directed relational system with involution and | an assigned Sheffer operation. Then, R is symmetric if and only if | satisfies the identity
Proof If R is symmetric, then any of the following assertions implies the next one: If, conversely, | satisfies identity (6), then any of the following assertions implies the next one: x |y = y, Another important property of a binary relation is antisymmetry. Recall that a binary relation R is antisymmetric if (x, y), (y, x) ∈ R implies x = y.

Theorem 4.2 Let A = (A, R, ) be a directed relational system with involution and | a Sheffer operation assigned to it.
Then, the following holds: Transitivity of a binary relation can be expressed by an identity for an assigned Sheffer operation as follows.

x|(((((x|y)|(x|y))|z)|(((x|y)|(x|y))|z)) ≈ ((x|y)|(x|y))|z.
If, conversely, | satisfies identity (7), then any of the following assertions implies the next one: x |y = y and y |z = z, Let us introduce the following concepts. A bounded relational system with involution is an ordered quintuple A = (A, R, , 0, 1) such that (A, R, ) is a directed relational system with involution, 0, 1 ∈ A and (0, x), (x, 1) ∈ R hold for all x ∈ A. A is called complemented if it is bounded and if U (x, x ) ≈ 1 ≈ 0 . In such a case, L(x, x ) ≈ 0. Also these properties of relational systems can be characterized by identities and quasi-identities for an assigned Sheffer operation. (A, R, ) be a directed relational system with involution and | a Sheffer operation assigned to it. Moreover, let 0, 1 ∈ A and put A := (A, R, , 0, 1). Then, the following holds: Proof (i) The assertions (0, x ) ∈ R and (x , 1) ∈ R are equivalent to 0 |x ≈ x and x|1 ≈ 1, respectively. (ii) The following are equivalent:

Theorem 4.4 Let
As mentioned in Section 2, the class of Sheffer groupoids forms a variety S. We can ask one more condition, namely commutativity of |. As shown in Theorems 3.7 and 4.2, the directed relational systems with involution induced by commutative Sheffer groupoids will have antisymmetric binary relations. We present a subvariety of the variety S containing all commutative Sheffer groupoids which has an important congruence property.
We recall that a variety V of algebras is called congruence distributive if every member of V has a distributive congruence lattice.

Kleene relational systems and twist products
At first, we show how homomorphisms of Sheffer groupoids are related with homomorphisms of induced directed relational systems with involution. Because in the literature there are different concepts of homomorphism of relational systems, we recall the following one. Hence, every directed relational system can be embedded into a directed relational system with involution.

Let (A, R) and (B, S) be relational systems. A mapping
The question arises whether a Sheffer operation assigned to the twist product of a directed relational system A with involution can be derived from a Sheffer operation assigned to A. We give a positive answer in the following theorem.
Theorem 5.5 Let (A, R, ) be a directed relational system with involution, | A an assigned Sheffer operation on A and define for all (x, y), (z, v) ∈ A 2 . Then, | B is a Sheffer operation on A 2 assigned to the twist product of (A, R).
Proof For a, b, c, d ∈ A, the following are equivalent: and the following are equivalent: In order to simplify notation, we extend binary relations between elements of a non-void set A to relations between subsets of A.
Let A be a non-void set, b, c be elements of A, B, C be subsets of A and R be a binary relation on A. We say (B, C) ∈ R if B × C ⊆ R. Instead of ({b}, C) ∈ R and (B, {c}) ∈ R, we shortly write (b, C) ∈ R and (B, c) ∈ R, respectively.
The concept of a Kleene lattice was introduced by J. A. Kalman in Kalman (1958). Recall that a distributive lattice (L, ∨, ∧, ) with antitone involution is called a Kleene lattice if it satisfies the so-called normality condition, i.e. the identity x ∧ x ≤ y ∨ y for all x, y ∈ L.
These lattices are used in logic in order to formalize certain De Morgan propositional logics. For posets with involution, this notion was already generalized by Chajda and Länger (to appear in Miskolc Math Notes), in the following way. A distributive poset (P, ≤, ) with involution is called a Kleene poset if L(x, x ) ≤ U (y, y ) for all x, y ∈ P which means that z ≤ v for all x, y ∈ P and all (z, v) ∈ L(x, x ) × U (y, y ).
Definition 5.6 (i) A Kleene relational system is a relational system (A, R, ) with antitone involution satisfying (ii) If A = (A, R) is a relational system, a ∈ A and (A 2 , S, * ) the twist product of A, then we define the following subset of A 2 : It is worth noticing that Kleene lattices and Kleene posets are Kleene relational systems according to our previous definition.
Using the above-defined subset of the twist product, we can show that every directed relational system with a transitive relation can be embedded into a Kleene relational system. we have (L((b, c), (c, b)), U ((d, e), (e, d))) ∈ S due to transitivity of S (which follows from the transitivity of R), and hence B is a Kleene relational system.
(ii) For all x ∈ A, we have (L(x, a), a), (a, U (x, a)) ∈ R, and hence (x, a) ∈ P a (A). The rest follows from Theorem 5.4.
It should be remarked that if R is transitive, then (P a (A), T , * ) is a relational subsystem of the twist product (A 2 , S, * ) of A.

Conclusion
We have shown that to every directed relational system A = (A, R, ) with involution, there can be assigned a Sheffer operation | on A such that the given system A can be reconstructed from the groupoid (A, |). Hence, investigations of these relational systems can be transferred to Sheffer groupoids, i.e., algebras forming a variety S defined by two simple identities which contains a non-trivial congruence distributive subvariety. Hence, properties of the binary relation R can be characterized by means of identities and quasiidentities of the assigned Sheffer groupoid. This is important because tools of general algebra are more developed than those of the theory of relations. Moreover, we have shown how every relational system (A, R) can be converted into a Kleene relational system by using the twist product construction. Remember that Kleene relational systems play an important role in substructural logics. If the Kleene relational system is constructed from a relational system with involution, then we showed how the Sheffer operation can be constructed. This research should go on in a purely algebraic way since we can study, e.g., subdirectly irreducible members or free algebras of the variety S by using the famous Jónsson's Lemma and the corresponding relational systems. However, these are topics for future research.