Ivan Chajda

Prof. Ivan Chajda

Department of Algebra and Geometry, Palacky University Olomouc
orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

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

21 October 2012 in Soft Computing
Verified
Journal Article
Closed access
PDF file
Ivan ChajdaIvan Chajda
Ivan Chajda
JKJan Kühr
Jan Kühr

12 May 2012 in Soft Computing
Verified
Journal Article
Closed access
PDF file
Ivan ChajdaIvan Chajda
Ivan Chajda
JPJan Paseka
Jan Paseka

25 April 2017 in Topological Algebra and its Applications
Verified
Journal Article
Open access
PDF file
Ivan ChajdaIvan Chajda
Ivan Chajda
HLHelmut Länger
Helmut Länger
We show that every idempotent weakly divisible residuated lattice satisfying the double negation law can be transformed into an orthomodular lattice. The converse holds if adjointness is replaced by conditional adjointness. Moreover, we show that every positive right residuated lattice satisfying the double negation law and two further simple identities can be converted into an orthomodular lattice. In this case, also the converse statement is true and the corresponence is nearly one-to-one.

15 September 2015 in Asian-European Journal of Mathematics
Verified
Journal Article
Closed access
Ivan ChajdaIvan Chajda
Ivan Chajda

10 March 2021 in Order
Verified
Journal Article
Open access
PDF file
Ivan ChajdaIvan Chajda
Ivan Chajda
HLHelmut Länger
Helmut Länger
JPJan Paseka
Jan Paseka
The concept of a sectionally pseudocomplemented lattice was introduced in Birkhoff (1979) as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular lattice N5. The aim of this paper is to extend the concept of sectional pseudocomplementation from lattices to posets. At first we show that the class of sectionally pseudocomplemented lattices forms a variety of lattices which can be described by two simple identities. This variety has nice congruence properties. We summarize properties of sectionally pseudocomplemented posets and show differences to relative pseudocomplementation. We prove that every sectionally pseudocomplemented poset is completelyL-semidistributive. We introduce the concept of congruence on these posets and show when the quotient structure becomes a poset again. Finally, we study the Dedekind-MacNeille completion of sectionally pseudocomplemented posets. We show that contrary to the case of relatively pseudocomplemented posets, this completion need not be sectionally pseudocomplemented but we present the construction of a so-called generalized ordinal sum which enables us to construct the Dedekind-MacNeille completion provided the completions of the summands are known.