A Note on Rough Concepts Logic

Article type: Research Article

Authors: Krynicki, Michał

Affiliations: Instytut Matematyki, Uniwersytet Warszawski, PKiN 9 p. 00-901 Warsaw, Poland

Abstract: In papers [4,5] Pawlak introduced the notion of a rough set and approximation space. In [6] Pawlak formulated some concept of rough logic. The notion of the approximate truth was considered by many philosophers and logicians and in the last time by computer scientists. This was motivated by some research in artificial intelligence as for example expert systems, approximate reasoning methods and information system with imprecise information. The concept of rough logic introduced in [6] based on the notion of approximate truth determined by rough sets. Following these ideas Rasiowa and Skowron in [7] proposed the apropriate first order logic for concepts of rough definability. We denote this logic by LR. In [9] Szczerba proposed some logic with additional quantifier as rough concepts logic. We denote this logic by L(QR). The aim of this paper is a comparizing of these two logics with respect to their expressive power and giving some propositions of some modificated versions of rough concepts logics. We use more or less standard notation. By [a]R we denote the equivalence class of the element a with respect to the equivalence relation R. We write L⩽L′ if expressive power of the logic L is weaker then t.he expressive power of the logic L′ (i.e. each class of models definable by a sentence from L is also definable by a sentence from L′). If L⩽L′ and L′⩽L then we say that L and L′ are equivalent and denote this by L≡L′. If L⩽L′ but L≢L′ then we write L<L′.

DOI: 10.3233/FI-1990-13206

Journal: Fundamenta Informaticae, vol. 13, no. 2, pp. 227-235, 1990