homepage TUCS

Jouni Järvinen, Michiro Kondo:
Many-Valued Logics for Rough Sets and Other Modal-Like Operations

Techreport
Year: 2008
Month: Feb
Number: 875
Institution: TUCS
Laboratory: Algorithmics, Discrete Mathematics for Information Technology

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.


Download full text
 
Retrieved on Wed, 08 Sep 2010 20:39:40 +0300.
Last modified on Wed, 01 Jul 2009 16:19:31 +0300.