TY  - GEN
ID  - cogprints1990
UR  - http://cogprints.org/1990/
A1  - Pagliani, Piero
Y1  - 1998///
N2  - Rough Set Systems, can be made into several logic-algebraic structures (for instance, semi-simple Nelson algebras, Heyting algebras, double Stone algebras, three-valued Łukasiewicz algebras and Chain Based Lattices). In the present paper, Rough Set Systems are analysed from the point of view of co-Heyting algebras. This new chapter in the algebraic analysis of Rough Sets does not follow from aesthetic or completeness issues, but it is a pretty immediate consequence of interpreting the basic features of co-Heyting algebras (originally introduced by C. Rauszer and investigated by W. Lawvere in the context of Continuum Physics), through the lenses of incomplete information analysis. Indeed Lawvere pointed out the role that the co-intuitionistic negation ''non'' (dual to the intuitionistic negation ''not'') plays in grasping the geometrical notion of ''boundary'' as well as the physical concepts of ''sub-body'' and ''essential core of a body'' and we aim at providing an outline of how and to what extent they are mirrored by the basic features of incomplete information analysis. 
PB  - Springer
KW  - rough sets
KW  -  co-Heyting algebras
KW  -  boudary regions
KW  - Leibniz rule
TI  - Intrinsic co-Heyting boundaries and information incompleteness in Rough Set Analysis
SP  - 123
AV  - public
EP  - 130
ER  -

<script src='https://archive-bar.soton.ac.uk/archive-bar.js'></script>
<script src='https://archive-bar.soton.ac.uk/google-analytics.js'></script>