@INPROCEEDINGS { Rsds3039,
author = {Polkowski, Lech T.}, 
title = {A Rough Mereological Logic: An Outline}, 
booktitle = {Proceedings of the Workshop on Concurrency, Specification and Programming (CS&P'2004)}, 
series =  = {Informatik Berichte}, 
volume = 170, 
pages = {336-343}, 
publisher = {Humboldt Universitat zu Berlin}, 
address = {Berlin, Germany}, 
month = {September}, 
year = 2004, 
editor = {Lindemann, Gabriela and Burkhard, Hans Dieter and Czaja, Ludwik and Skowron, Andrzej and Schlingloff, Holger and Suraj, Zbigniew}, 
issn = {0863-095X}, 
abstract = {A 3-valued logical structure can be related to a space of rough sets on the basis of three regions into which any rough set x divides the universe., viz., the lower definable set i(x), the upper definable set associated knowledge. A 3-valued intensional rough logic RL of unary predicates in which values of logical formulas are given as intensions over possible worlds that are definable sets in a model of rough set theory (RZF), was defined recently. In this work, we would like to extend that construction to a logic valued in the interval [0,1], replacing the standard set inclusion of RL with a rough mereological inclusion.}, 
keywords = {rough sets, definable sets, rough elementship, rough set theory (RST), rough logic (RL), rough mereological logic (RML), }, 
}