Where academic tradition
meets the exciting future

Many-Valued Logics for Rough Sets and Other Modal-Like Operations

Jouni Järvinen, Michiro Kondo, Many-Valued Logics for Rough Sets and Other Modal-Like Operations. TUCS Technical Reports 875, Turku Centre for Computer Science, 2008.

Abstract:

Many modal connectives may be considered either complete join- or meet-morphism on a complete lattice. Therefore, they induce Galois connections. In this work we introduce a negationless logic which can be characterized by the class of upper-bounded distributive lattices equipped with a Galois connection.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tJaKo08a,
  title = {Many-Valued Logics for Rough Sets and Other Modal-Like Operations},
  author = {Järvinen, Jouni and Kondo, Michiro},
  number = {875},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2008},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI), FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication