# A Geometry of ApproximationApproximation and Algebraic Logic

A Geometry of Approximation: Approximation and Algebraic Logic Chapter 8 Approximation and Algebraic Logic 8.1 Approximation Operators Of course, in order to honour the philosophy of Rough Set Theory, we must endow any Rough Set Systems RS(U ) with a couple of operators reﬂecting the approximation features provided by the theory, applied, this time, not to sets but to rough sets. Let us connect the knowledge- oriented interpretation of these operators to their logical properties. We are looking for two operators M and L such that the following diagrams commute: (uE) (lE) ℘(U ) AS(U ) ℘(U ) AS(U ) rs rs rs rs RS(U ) rs(AS(U )) RS(U ) rs(AS(U )) M L Proposition 8.1.1. If the above diagrams commute then for any rough set (uE)(X), (lE)(X), 1. L((uE)(X), (lE)(X))= (lE)(X), (lE)(X). 2. M ((uE)(X), (lE)(X))= (uE)(X), (uE)(X). Proof. For any X ∈ ℘(U ), (lE)(X) ∈ AS(U ). But for any element A of AS(U ), rs(A)= A, A.Thus rs((lE)(X)) = (lE)(X), (lE)(X). Similarly for M . qed 237 238 8 Approximation and Algebraic Logic So, let us deﬁne the two operators in the following manner: Deﬁnition 8.1.1. For any Rough Set System RS(U ), for any a ∈ RS(U ), (1) M (a)= a http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

# A Geometry of ApproximationApproximation and Algebraic Logic

Part of the Trends in Logic Book Series (volume 27)
Editors: Pagliani, Piero; Chakraborty, Mihir
A Geometry of Approximation — Jan 1, 2008
18 pages      /lp/springer-journals/a-geometry-of-approximation-approximation-and-algebraic-logic-WhJ47hB0ti
Publisher
Springer Netherlands
ISBN
978-1-4020-8621-2
Pages
237 –254
DOI
10.1007/978-1-4020-8622-9_8
Publisher site
See Chapter on Publisher Site

### Abstract

Chapter 8 Approximation and Algebraic Logic 8.1 Approximation Operators Of course, in order to honour the philosophy of Rough Set Theory, we must endow any Rough Set Systems RS(U ) with a couple of operators reﬂecting the approximation features provided by the theory, applied, this time, not to sets but to rough sets. Let us connect the knowledge- oriented interpretation of these operators to their logical properties. We are looking for two operators M and L such that the following diagrams commute: (uE) (lE) ℘(U ) AS(U ) ℘(U ) AS(U ) rs rs rs rs RS(U ) rs(AS(U )) RS(U ) rs(AS(U )) M L Proposition 8.1.1. If the above diagrams commute then for any rough set (uE)(X), (lE)(X), 1. L((uE)(X), (lE)(X))= (lE)(X), (lE)(X). 2. M ((uE)(X), (lE)(X))= (uE)(X), (uE)(X). Proof. For any X ∈ ℘(U ), (lE)(X) ∈ AS(U ). But for any element A of AS(U ), rs(A)= A, A.Thus rs((lE)(X)) = (lE)(X), (lE)(X). Similarly for M . qed 237 238 8 Approximation and Algebraic Logic So, let us deﬁne the two operators in the following manner: Deﬁnition 8.1.1. For any Rough Set System RS(U ), for any a ∈ RS(U ), (1) M (a)= a

Published: Jan 1, 2008