arXiv subjects

Ivan Chajda

Publications and source records attributed to Ivan Chajda.

At least 55 records · Page 3Linked to original sources

arXiv2021

Tolerances on posets

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édli 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.

math.CO↗

arXiv2021

Compositions and decompositions of binary relations

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.

math.RA↗

arXiv2021

Constructions of Kleene lattices

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.

math.LO↗

arXiv2021

Integration in semirings

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.

math.RA↗

arXiv2021

Implication in finite posets with pseudocomplemented sections

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.

math.LO↗

arXiv2021

Conditions forcing the existence of relative complements in lattices and posets

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.

math.CO↗

arXiv2021

An algebraic analysis of implication in non-distributive logics

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.

math.LO↗

arXiv2021

Join-semilattices whose principal filters are pseudocomplemented lattices

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.

math.LO↗

arXiv2021

Algebras describing pseudocomplemented, relatively pseudocomplemented and sectionally pseudocomplemented posets

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.

math.RA↗

arXiv2021

Monotone and cone preserving mappings on posets

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.

math.CO↗

arXiv2021

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 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.

math.RA↗

arXiv2021

Adjoint operations in twist-products of lattices

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.

math.RA↗

arXiv2020

Residuation in twist products and pseudo-Kleene posets Abstract

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.

math.RA↗

arXiv2020

Algebraic properties of paraorthomodular posets

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.

math.LO↗

arXiv2020

Logical and algebraic properties of generalized orthomodular posets

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 properties of these posets. In the present paper we study logical and algebraic properties of these posets. In particular, we investigate conditions under which they can be converted into operator residuated structures. Further, we study their representation by means of algebras (directoids) with everywhere defined operations. We prove congruence properties for the class of algebras assigned to generalized orthomodular posets and, in particular, for a subvariety of this class determined by a simple identity. Finally, in contrast to the fact that the Dedekind-MacNeille completion of an orthomodular poset need not be an orthomodular lattice we show that the Dedekind-MacNeille completion of a stronger version of a generalized orthomodular poset is nearly an orthomodular lattice.

math.LO↗

arXiv2020

Filters and congruences in sectionally pseudocomplemented lattices and posets

In our previous papers, 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 both in 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.

math.LO↗

arXiv2020

Consistent posets

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their lower cone is different form 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.

math.LO↗

arXiv2020

Kleene posets and pseudo-Kleene posets

The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how (pseudo-)Kleene posets can be characterized by identities and implications of assigned commutative meet-directoids. Moreover, we prove that the Dedekind-MacNeille completion of a pseudo-Kleene poset is a pseudo-Kleene algebra and that the Dedekind-MacNeille completion of a finite Kleene poset is a Kleene algebra. Further, we introduce the concept of a strict (pseudo-)Kleene poset and show that under an additional assumption a strict Kleene poset can be organized into a residuated structure. Finally, we prove by using the so-called twist construction that every poset can be embedded into a pseudo-Kleene poset in some natural way.

math.RA↗