Abstract
In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics.
We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness” operator.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avron A.: ‘Natural 3-valued Logics—Characterization and Proof Theory’. Journal of Symbolic Logic 56, 276–294 (1991)
Avron, A., ‘Classical Gentzen-type Methods in Propositional Many-Valued Logics’, in M. Fitting and E. Orlowska (eds.), Beyond Two: Theory and Applications of Multiple-Valued Logic, Studies in Fuzziness and Soft Computing 114, Physica Verlag, 2003, pp. 117–155.
Avron, A., ‘Logical Non-determinism as a Tool for Logical Modularity: An Introduction’, in S. Artemov, H. Barringer, A. S. d’Avila Garcez, L. C. Lamb, and J. Woods (eds.), We Will Show Them: Essays in Honor of Dov Gabbay, 1, 105–124, College Publications, 2005.
Avron A., Lev I.: ‘Non-deterministic Multiple-valued Structures’. Journal of Logic and Computation 15, 241–261 (2005)
Béziau J.-Y.: ‘Sequents and Bivaluations’. Logique et Analyse 44, 373–394 (2001)
Busch, D.R., ‘An expressive three-valued logic with two negations’, in J. Komorowski and Z.W. Ra´s (eds.), Methodologies for Intelligent Systems (Proceedings of ISMIS’ 93), LNAI 689:29–38, 1993.
Carnielli, W.A. and J. Marcos, ‘A Taxonomy of C-systems’, in W. A. Carnielli, M. E. Coniglio, and I. L. M. D’ottaviano (eds.), Paraconsistency—the logical way to the sistent, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, 2002, pp. 1–94.
da Costa N.C.A.: ‘On the theory of sistent formal systems’. Notre Dame Journal of Formal Logic 15, 497–510 (1974)
da Costa N.C.A., Krause D., Bueno O.(2007). ‘Paraconsistent Logics and Paraconsistency: Technical and Philosophical Developments’. In:Jacquette D.(eds). Philosophy of Logic. Amsterdam, North-Holland, pp 791-911
D’Ottaviano I.M.L.: ‘The completeness and compactness of a three-valued firstorder logic’. Revista Colombiana de Matematicas XIX, 31–42 (1985)
Epstein, R. L. The Semantic Foundations of Logic, vol. 1: Propositional Logics, Kluwer Academic Publishers, 1990.
Kleene, S.C. Introduction to metamathematics, D. van Nostrad Co., 1952.
Konikowska B.: ‘Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus’. Journal for Applied Non-Classical Logic 3, 39–71 (1993)
Konikowska B.: ‘A logic for reasoning about relative similarity’. Studia Logica 58, 185–226 (1997)
Jones C.B.: Systematic Software Development Using VDM, Prentice-Hall International. Prentice-Hall International, U.K. (1986)
Lin, T.Y., Cercone, N. (eds): Rough sets and Data Mining. Analysis of Imprecise Data. Kluwer, Dordrecht (1997)
Łukasiewicz, J., ‘On 3-valued Logic’, 1920, in S. McCall (ed.), Polish Logic, Oxford University Press, 1967.
Øhrn A., Komorowski J., Skowron A., Synak P.(1998). ‘The design and implementation of a knowledge discovery toolkit based on rough sets—The ROSETTA system’. In: Polkowski L., Skowron A.(eds). Rough Sets in Knowledge Discovery 1. Methodology and Applications. Physica Verlag, Heidelberg, pp 376–399
Øhrn A., Komorowski J., Skowron A., Synak P.(1998). ‘The ROSETTA software system’. In: Polkowski L., Skowron A.(eds). Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems. Physica Verlag, Heidelberg, pp 572–576
Pawlak Z.: ‘Rough Sets’. Intern. J. Comp. Inform. Sci. 11, 341–356 (1982)
Pawlak Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)
Pawlak Z.: ‘Rough set approach to knowledge-based decision support’. European Journal of Operational Research 29(3), 1–10 (1997)
Pawlak Z.: ‘Rough sets theory and its applications to data analysis’. Cybernetics and Systems 29, 661–688 (1998)
Wang H.: ‘The calculus of partial predicates and its extension to set theory’. Zietschr. math. Logik Grundl. Math. 7, 283–288 (1961)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Avron, A., Konikowska, B. Rough Sets and 3-Valued Logics. Stud Logica 90, 69–92 (2008). https://doi.org/10.1007/s11225-008-9144-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-008-9144-3