Sequences of Orthopairs Given by Refinements of Coverings
In this paper we consider sequences of orthopairs given by refinements of coverings and partitions of a finite universe. While operations among orthopairs can be fruitfully interpreted by connectives of three-valued logics, we investigate the algebraic structures that are the counterpart of operations among sequences of orthopairs.
KeywordsOrthopairs Forests Many-valued algebraic structures Gödel algebras
- 2.Aguzzoli, S., Flaminio, T., Marchioni, E.: Finite Forests. Their Algebras and Logics (submitted)Google Scholar
- 5.Belolahvek, R., Sklenar, V., Zacpal, J.: Formal concept analysis with hierarchically ordered attributes. Int. J. Gen. Syst. 1–12 (2004)Google Scholar
- 10.Comer, S.D.: On connections between information systems, rough sets, and algebraic logic. In: Algebraic Methods in Logic and Computer Science, pp. 117–124. Banach Center Publications, no. 28 (1993)Google Scholar