Ivan Chajda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ivan Chajda has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Helmut Länger
Faculty of Mathematics and Geoinformation, Institute of Discrete Mathematics and Geometry, TU Wien, Vienna, Austria
112 shared publications - Jan Paseka
Department of Mathematics and Statistics, Masaryk University, Brno, Czech Republic
21 shared publications - Antonio Ledda
Università degli Studi di Cagliari, Facoltà di Studi Umanistici, Cagliari, Italia image/svg+xml
13 shared publications - Miroslav Kolařík
Institute of Microbiology of the Czech Academy of Sciences, Vídeňská, Praha 4, Czech Republic
13 shared publications - Radomír Halaš
Department of Algebra and Geometry, Faculty of Science Palacký University Olomouc, Olomouc, Czech Republic
11 shared publications - Stefano Bonzio
Universitá degli Studi di Cagliari
6 shared publications
Latest Publications
- Open Access
- 31 October 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (11) , 7295-7303
Derived operators on skew orthomodular and strong skew orthomodular posets
It is well-known that in the logic of quantum mechanics disjunctions and conjunctions can be represented by joins and meets, respectively, in an orthomodular lattice provided their entries commute. This was the reason why J. Pykacz introduced new derived operations called “sharp” and “flat” coinciding with joins and meets, respectively, for commuting elements but sharing some appropriate properties with disjunction and conjunction, respectively, in the whole orthomodular lattice in question. The problem is that orthomodular lattices need not formalize the logic of quantum mechanics since joins may not be defined if their entries are neither comparable nor orthogonal. A corresponding fact holds for meets. Therefore, orthomodular posets are more accepted as an algebraic formalization of such a logic. The aim of the present paper is to extend the concepts of “sharp” and “flat” operations to operators in skew orthomodular and strong skew orthomodular posets. We generalize the relation of commuting elements as well as the commutator to such posets and we present some important properties of these operators and their mutual relationships. Moreover, we show that if the poset in question is even Boolean then there can be defined a ternary operator sharing the identities of a Pixley term. Finally, under some weak conditions which are automatically satisfied in Boolean algebras we show some kind of adjointness for operators formalizing conjunction and implication, respectively.
- 31 October 2026
- Published by Springer Nature in Soft Computing
- Vol. 30 (11) , 7295-7303
Open AccessDerived operators on skew orthomodular and strong skew orthomodular posets
It is well-known that in the logic of quantum mechanics disjunctions and conjunctions can be represented by joins and meets, respectively, in an orthomodular lattice provided their entries commute. This was the reason why J. Pykacz introduced new derived operations called “sharp” and “flat” coinciding with joins and meets, respectively, for commuting elements but sharing some appropriate properties with disjunction and conjunction, respectively, in the whole orthomodular lattice in question. The problem is that orthomodular lattices need not formalize the logic of quantum mechanics since joins may not be defined if their entries are neither comparable nor orthogonal. A corresponding fact holds for meets. Therefore, orthomodular posets are more accepted as an algebraic formalization of such a logic. The aim of the present paper is to extend the concepts of “sharp” and “flat” operations to operators in skew orthomodular and strong skew orthomodular posets. We generalize the relation of commuting elements as well as the commutator to such posets and we present some important properties of these operators and their mutual relationships. Moreover, we show that if the poset in question is even Boolean then there can be defined a ternary operator sharing the identities of a Pixley term. Finally, under some weak conditions which are automatically satisfied in Boolean algebras we show some kind of adjointness for operators formalizing conjunction and implication, respectively.
- Open Access
- 30 July 2026
- Published by Springer Nature in Order
- Vol. 43 (2) , 26
L-congruences on Posets, Relatively Pseudocomplemented and Boolean posets
In the present paper we introduce and investigate a new kind of generalization of the notion of a lattice congruence to posets. Other such generalizations can be found e.g. in [5, 7] and [9]. In those papers congruences on posets are defined as kernels of some kind of homomorphisms. But in case of lattices these homomorphisms need not be lattice homomorphisms and hence the corresponding poset congruences need not be lattice congruences. This disadvantage disappears when using our approach. We show that the classes of our so-called L-congruences are convex. If the poset in question satisfies the Ascending Chain Condition as well as the Descending Chain Condition, then these classes turn out to be intervals. If the poset has a top element 1 then the 1-class of an L-congruence is a so-called strong filter. We study special L-congruences on relatively pseudocomplemented posets which form a formalization of intuitionistic logic. For such posets we define so-called deductive systems and we show how they are connected with kernels of L-congruences. We prove that every strong filter F of a relatively pseudocomplemented poset induces an L-congruence having F as its kernel. Finally, we consider Boolean posets which form a natural generalization of Boolean algebras. We show that special L-congruences on Boolean posets in general do not share properties known from Boolean algebras, but kernels of L-congruences on Boolean posets still have some interesting properties.
- 30 July 2026
- Published by Springer Nature in Order
- Vol. 43 (2) , 26
Open AccessL-congruences on Posets, Relatively Pseudocomplemented and Boolean posets
In the present paper we introduce and investigate a new kind of generalization of the notion of a lattice congruence to posets. Other such generalizations can be found e.g. in [5, 7] and [9]. In those papers congruences on posets are defined as kernels of some kind of homomorphisms. But in case of lattices these homomorphisms need not be lattice homomorphisms and hence the corresponding poset congruences need not be lattice congruences. This disadvantage disappears when using our approach. We show that the classes of our so-called L-congruences are convex. If the poset in question satisfies the Ascending Chain Condition as well as the Descending Chain Condition, then these classes turn out to be intervals. If the poset has a top element 1 then the 1-class of an L-congruence is a so-called strong filter. We study special L-congruences on relatively pseudocomplemented posets which form a formalization of intuitionistic logic. For such posets we define so-called deductive systems and we show how they are connected with kernels of L-congruences. We prove that every strong filter F of a relatively pseudocomplemented poset induces an L-congruence having F as its kernel. Finally, we consider Boolean posets which form a natural generalization of Boolean algebras. We show that special L-congruences on Boolean posets in general do not share properties known from Boolean algebras, but kernels of L-congruences on Boolean posets still have some interesting properties.
- Open Access
- 21 April 2026
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 76 (3) , 591-604
Properties of the symmetric difference in lattices with complementation
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices with complementation and the variety of such lattices where these two expressions coincide and point out explicitly some interesting subvarieties. Using a result of J. Berman we estimate the size of free algebras in these subvarieties. It is well-known that the symmetric difference is associative in every Boolean lattice. We prove that it is just the property of Boolean lattices, namely the symmetric difference in a lattice with complementation is associative if and only if this lattice is Boolean. Similarly, we prove that a lattice with complementation is Boolean if and only if the symmetric difference satisfies a certain simple identity in two variables. We also characterize lattices with a unary operation satisfying De Morgan’s laws.
- 21 April 2026
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 76 (3) , 591-604
Open AccessProperties of the symmetric difference in lattices with complementation
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices with complementation and the variety of such lattices where these two expressions coincide and point out explicitly some interesting subvarieties. Using a result of J. Berman we estimate the size of free algebras in these subvarieties. It is well-known that the symmetric difference is associative in every Boolean lattice. We prove that it is just the property of Boolean lattices, namely the symmetric difference in a lattice with complementation is associative if and only if this lattice is Boolean. Similarly, we prove that a lattice with complementation is Boolean if and only if the symmetric difference satisfies a certain simple identity in two variables. We also characterize lattices with a unary operation satisfying De Morgan’s laws.
- 24 January 2026
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 19 (11)
Lagrange-like interpolation in unitary rings, Boolean algebras and Boolean posets
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra instead of a field. We get a positive answer to this question provided the similarity type of the algebra in question is enriched with one more unary operation, the so-called Baaz delta. We get an explicit construction of this interpolation polynomial in both the cases. When going to Boolean posets, we have a lack of operations but these can be substituted by the operators [ ] and [ ]. Hence, we generalize also the Baaz delta for posets as an operator and then we can derive an explicit interpolation term constructed by means of these operators also for Boolean posets.
- 24 January 2026
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 19 (11)
Lagrange-like interpolation in unitary rings, Boolean algebras and Boolean posets
It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra instead of a field. We get a positive answer to this question provided the similarity type of the algebra in question is enriched with one more unary operation, the so-called Baaz delta. We get an explicit construction of this interpolation polynomial in both the cases. When going to Boolean posets, we have a lack of operations but these can be substituted by the operators [ ] and [ ]. Hence, we generalize also the Baaz delta for posets as an operator and then we can derive an explicit interpolation term constructed by means of these operators also for Boolean posets.
- Open Access
- 31 October 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (23-24) , 5925-5932
Filters and ideals in pseudocomplemented posets
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.- 31 October 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (23-24) , 5925-5932
Open AccessFilters and ideals in pseudocomplemented posets
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. - 13 October 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 523
Unsharp residuation in posets
- 13 October 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 523
Unsharp residuation in posets
- 9 October 2025
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 151 (4) , 1-16
Quasimodules over bounded lattices
Institute of Mathematics of the Czech Academy of Sciences
- 9 October 2025
- Published by Institute of Mathematics, Czech Academy of Sciences
- Vol. 151 (4) , 1-16
Quasimodules over bounded lattices
Institute of Mathematics of the Czech Academy of Sciences
- Open Access
- 1 April 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (7) , 3115-3123
Operators on complemented lattices
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 $$\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.- 1 April 2025
- Published by Springer Nature in Soft Computing
- Vol. 29 (7) , 3115-3123
Open AccessOperators on complemented lattices
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 $$\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. - Open Access
Congruences on posets, relatively pseudocomplemented and Boolean posets
The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Snášel. By using our definition we show that congruence classes are convex. If the poset in question satisfies the Ascending Chain Condition as well as the Descending Chain Condition, then these classes turn out to be intervals. If the poset has a top element 1 then the 1-class of every congruence is a so-called strong filter. We study congruences on relatively pseudocomplemented posets which form a formalization of intuitionistic logic. For such posets we define so-called deductive systems and we show how they are connected with congruence kernels. We prove that every strong filter F of a relatively pseudocomplemented poset induces a congruence having F as its kernel. Finally, we consider Boolean posets which form a natural generalization of Boolean algebras. We show that congruences on Boolean posets in general do not share properties known from Boolean algebras, but congruence kernels of Boolean posets still have some interesting properties.
Open AccessCongruences on posets, relatively pseudocomplemented and Boolean posets
The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Snášel. By using our definition we show that congruence classes are convex. If the poset in question satisfies the Ascending Chain Condition as well as the Descending Chain Condition, then these classes turn out to be intervals. If the poset has a top element 1 then the 1-class of every congruence is a so-called strong filter. We study congruences on relatively pseudocomplemented posets which form a formalization of intuitionistic logic. For such posets we define so-called deductive systems and we show how they are connected with congruence kernels. We prove that every strong filter F of a relatively pseudocomplemented poset induces a congruence having F as its kernel. Finally, we consider Boolean posets which form a natural generalization of Boolean algebras. We show that congruences on Boolean posets in general do not share properties known from Boolean algebras, but congruence kernels of Boolean posets still have some interesting properties.
- 24 February 2025
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 18 (07)
The operator of relative complementation
By the operator of relative complementation is meant a mapping assigning to every element [ ] of an interval [ ] of a lattice [ ] the set [ ] of all relative complements of [ ] in [ ]. Of course, if [ ] is relatively complemented then [ ] is nonempty for each interval [ ] and every element [ ] belonging to it. We study the question under what condition a complement of [ ] in [ ] induces a relative complement of [ ] in [ ]. It is well-known that this is the case provided [ ] 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 [ ] is a modular sublattice of [ ] or if it is finite. Moreover, we characterize when the operator [ ] of relative complementation satisfies the identity [ ] provided [ ] is complemented 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 [ ] of [ ] induce the same relative complement of [ ] in this interval.
- 24 February 2025
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 18 (07)
The operator of relative complementation
By the operator of relative complementation is meant a mapping assigning to every element [ ] of an interval [ ] of a lattice [ ] the set [ ] of all relative complements of [ ] in [ ]. Of course, if [ ] is relatively complemented then [ ] is nonempty for each interval [ ] and every element [ ] belonging to it. We study the question under what condition a complement of [ ] in [ ] induces a relative complement of [ ] in [ ]. It is well-known that this is the case provided [ ] 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 [ ] is a modular sublattice of [ ] or if it is finite. Moreover, we characterize when the operator [ ] of relative complementation satisfies the identity [ ] provided [ ] is complemented 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 [ ] of [ ] induce the same relative complement of [ ] in this interval.