nach oben

Erschienen in:

2022 | OriginalPaper | Buchkapitel

A Study of Algebraic Structures and Logics Based on Categories of Rough Sets

verfasst von : Anuj Kumar More

Erschienen in: Transactions on Rough Sets XXIII

Verlag: Springer Berlin Heidelberg

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The theory of rough sets has been studied extensively, both from foundation and application points of view, since its introduction by Pawlak in 1982. On the foundations side, a substantial part of work on rough set theory involves the study of its algebraic aspects and logics. The present work is in this direction, initiated through the study of categories of rough sets.

Starting from two categories RSC and ROUGH of rough sets, it is shown that they are equivalent. Moreover, RSC, and thus ROUGH, are found to be a quasitopos, a structure slightly weaker than topos. The construction is then lifted to a more general set-up to give the category RSC(\(\mathscr {C}\)) with an arbitrary non-degenerate topos \(\mathscr {C}\) serving as a ‘base’, just as sets constitute a base for defining rough sets.

The category-theoretic study gives rise to two directions of work. In one direction of work, a particular example of RSC(\(\mathscr {C}\)) when \(\mathscr {C}\) is the topos of monoid actions on sets is considered. It yields the monoid actions on rough sets and that of transformation semigroups (ts) for rough sets, leading to decomposition results. A semiautomaton for rough sets is also defined.

In the other direction, we incorporate Iwinski’s notion of ‘relative rough complementation’ in the internal algebra of the quasitopos RSC(\(\mathscr {C}\)). This results in the introduction of two new classes of algebraic structures with two negations, namely contrapositionally complemented pseudo-Boolean algebra (ccpBa) and contrapositionally \({\vee }\) complemented pseudo-Boolean algebra (c\(\vee \)cpBa). Examples of ccpBas and c\(\vee \)cpBas are developed, comparison with existing algebras is done and representation theorems are established.

The logics ILM and ILM-\(\vee \) corresponding to ccpBas and c\({\vee }\)cpBas respectively are defined, and different relational semantics are obtained. It is shown that ILM is a proper extension of a variant JP\('\) of Peirce’s logic, defined by Segerberg in 1968. The inter-relationship between relational semantics and the algebraic semantics of ILM and ILM-\({\vee }\) are investigated. Lastly, in the line of Dunn’s study of logics, the two negations are expressed without the help of the connective of implication, and the resulting logical and algebraic structures are also studied.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Selected Aspects of Interactive Feature Extraction

Nur mit Berechtigung zugänglich

Arbib, M.A.: Theories of Abstract Automata. Prentice-Hall, Hoboken (1969)MATH

Arbib, M.A., Krohn, K., Rhodes, J.L.: Algebraic Theory of Machines, Languages, and Semigroups. Academic Press, Cambridge (1968)

Awodey, S.: Category Theory. Oxford University Press, Oxford (2010)MATH

Banerjee, M., Chakraborty, M.K.: A category for rough sets. Found. Comput. Decis. Sci. 18(3–4), 167–180 (1993)MathSciNetMATH

Banerjee, M., Chakraborty, M.K.: Rough sets through algebraic logic. Fund. Inform. 28(3–4), 211–221 (1996)MathSciNetMATH

Banerjee, M., Chakraborty, M.K.: Foundations of vagueness: a category-theoretic approach. Electron. Notes Theor. Comput. Sci. 82(4), 10–19 (2003)MATHCrossRef

Banerjee, M., Chakraborty, M.K.: Algebras from rough sets. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neural Computing: Techniques for Computing with Words, pp. 157–184. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-642-18859-6_7CrossRef

Banerjee, M., Yao, Y.: A categorial basis for granular computing. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds.) RSFDGrC 2007. LNCS (LNAI), vol. 4482, pp. 427–434. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72530-5_51CrossRef

Basu, S.: Rough finite-state automata. Cybern. Syst. 36(2), 107–124 (2005)MATHCrossRef

10.

Bavel, Z.: The source as a tool in automata. Inf. Control 18(2), 140–155 (1971)MathSciNetMATHCrossRef

11.

Bezhanishvili, G., Holliday, W.H.: A semantic hierarchy for intuitionistic logic. Indagationes Mathematicae 30(3), 403–469 (2019)MathSciNetMATHCrossRef

12.

Bezhanishvili, N.: Lattices of intermediate and cylindric modal logics. Ph.D. thesis, Institute for Logic, Language and Computation, University of Amsterdam (2006)

13.

Borzooei, R.A., Estaji, A.A., Mobini, M.: On the category of rough sets. Soft. Comput. 21(9), 2201–2214 (2017)MATHCrossRef

14.

Carnielli, W.A., D’Ottaviano, I.M.L.: Translations between logical systems: a manifesto. Logique et Anal. 40(157), 67–81 (1997)MathSciNetMATH

15.

Cattaneo, G., Giuntini, R., Pilla, R.: BZMV\(^{\rm dM}\) algebras and Stonian MV-algebras (applications to fuzzy sets and rough approximations). Fuzzy Sets Syst. 108(2), 201–222 (1999)MathSciNetMATHCrossRef

16.

Celani, S.A., Jansana, R.: Easkia duality and its extensions. In: Bezhanishvili, G. (ed.) Leo Esakia on Duality in Modal and Intuitionistic Logics. OCL, vol. 4, pp. 63–98. Springer, Dordrecht (2014). https://doi.org/10.1007/978-94-017-8860-1_4CrossRefMATH

17.

Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)MATH

18.

Chomsky, N.: Three models for the description of language. IRE Trans. Inf. Theory 2(3), 113–124 (1956)MATHCrossRef

19.

Cignoli, R.: The algebras of Łukasiewicz many-valued logic: a historical overview. In: Aguzzoli, S., Ciabattoni, A., Gerla, B., Manara, C., Marra, V. (eds.) Algebraic and Proof-theoretic Aspects of Non-classical Logics. LNCS (LNAI), vol. 4460, pp. 69–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75939-3_5CrossRefMATH

20.

Clark, D.M., Davey, B.A.: Natural Dualities for the Working Algebraist. Cambridge Studies in Advanced Mathematics, vol. 57. Cambridge University Press, Cambridge (1998)

21.

Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, vol. 1. American Mathematical Society, Providence (1961)MATH

22.

Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, vol. 2. American Mathematical Society, Providence (1961)MATH

23.

Colacito, A., de Jongh, D., Vargas, A.L.: Subminimal negation. Soft Comput. 21(1), 165–174 (2017)MATHCrossRef

24.

Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)MATHCrossRef

25.

Diker, M.: Categories of rough sets and textures. Theoret. Comput. Sci. 488, 46–65 (2013)MathSciNetMATHCrossRef

26.

Diker, M.: A category approach to relation preserving functions in rough set theory. Int. J. Approx. Reason. 56, 71–86 (2015)MathSciNetMATHCrossRef

27.

Došen, K.: Negation as a modal operator. Rep. Math. Logic 20, 15–27 (1986)MathSciNetMATH

28.

Došen, K.: Negation in the light of modal logic. In: Gabbay, D.M., Wansing, H. (eds.) What is Negation? Applied Logic Series, vol. 13, pp. 77–86. Springer, Dordrecht (1999). https://doi.org/10.1007/978-94-015-9309-0_4CrossRefMATH

29.

Dunn, J.M.: Gaggle theory: an abstraction of Galois connections and residuation, with applications to negation, implication, and various logical operators. In: van Eijck, J. (ed.) JELIA 1990. LNCS, vol. 478, pp. 31–51. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0018431CrossRef

30.

Dunn, J.M.: Star and perp: two treatments of negation. Philos. Perspect. 7, 331–357 (1993)CrossRef

31.

Dunn, J.M.: Positive modal logic. Stud. Logica. 55(2), 301–317 (1995)MathSciNetMATHCrossRef

32.

Dunn, J.M.: Generalized ortho negation. In: Wansing, H. (ed.) Negation: A Notion in Focus, pp. 3–26. W. De Gruyter, Berlin (1996)CrossRef

33.

Dunn, J.M., Zhou, C.: Negation in the context of gaggle theory. Stud. Logica. 80(2–3), 235–264 (2005)MathSciNetMATHCrossRef

34.

Eilenberg, S., Tilson, B.: Automata, Languages, and Machines. Volume B. Pure & Applied Mathematics. Academic Press, Cambridge (1976)

35.

Eklund, P., Galán, M.A.: Monads can be rough. In: Greco, S., et al. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 77–84. Springer, Heidelberg (2006). https://doi.org/10.1007/11908029_9CrossRefMATH

36.

Esteva, F., Godo, L., Hájek, P., Navara, M.: Residuated fuzzy logics with an involutive negation. Arch. Math. Logic 39(2), 103–124 (2000)MathSciNetMATHCrossRef

37.

Ferreira, G., Oliva, P.: On the relation between various negative translations. In: Logic, Construction, Computation. Ontos Mathematical Logic, vol. 3, pp. 227–258. Ontos Verlag, Heusenstamm (2012)

38.

Fu, T.K., Kutz, O.: The analysis and synthesis of logic translation. In: FLAIRS Conference (2012)

39.

Geisler, J., Nowak, M.: Conditional negation on the positive logic. Bull. Sect. Logic 23(3), 130–136 (1994)MathSciNetMATH

40.

Ginsburg, S.: Some remarks on abstract machines. Trans. Am. Math. Soc. 96(3), 400–444 (1960)MATHCrossRef

41.

Goguen, J.A.: Concept representation in natural and artificial languages: axioms, extensions and applications for fuzzy sets. Int. J. Man Mach. Stud. 6(5), 513–561 (1974)MathSciNetMATHCrossRef

42.

Goldblatt, R.I.: Decidability of some extensions of. J. Z. Math. Logik Grundlagen Math. 20, 203–205 (1974)MathSciNetMATHCrossRef

43.

Goldblatt, R.I.: Topoi: The Categorial Analysis of Logic. Dover Books on Mathematics. Dover Publications, Mineola (2006)

44.

Gurevich, Y.: Intuitionistic logic with strong negation. Stud. Logica. 36(1), 49–59 (1977)MathSciNetMATHCrossRef

45.

Höhle, U., Stout, L.N.: Foundations of fuzzy sets. Fuzzy Sets Syst. 40(2), 257–296 (1991)MathSciNetMATHCrossRef

46.

Holcombe, W.M.L.: Algebraic Automata Theory. Cambridge University Press, Cambridge (1982)MATHCrossRef

47.

Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson/Addison Wesley, Reading (2007)

48.

Iwiński, T.B.: Algebraic approach to rough sets. Bull. Polish Acad. Sci. Math. 35, 673–683 (1987)MathSciNetMATH

49.

Johansson, I.: Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus. Compositio Math. 4, 119–136 (1937)MathSciNetMATH

50.

Johnstone, P.T.: Stone Spaces, vol. 3. Cambridge University Press, Cambridge (1986)MATH

51.

Johnstone, P.T.: Sketches of an Elephant: A Topos Theory Compendium, vol. 2. Oxford University Press, Oxford (2002)MATH

52.

Johnstone, P.T., Lack, S., Sobociński, P.: Quasitoposes, quasiadhesive categories and artin glueing. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 312–326. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73859-6_21CrossRefMATH

53.

Kiszka, J.B., Gupta, M.M., Trojan, G.M.: Multivariable fuzzy controller under Gödel’s implication. Fuzzy Sets Syst. 34(3), 301–321 (1990)CrossRef

54.

Kripke, S.A.: Semantical analysis of modal logic. I. Normal modal propositional calculi. Z. Math. Logik Grundlagen Math. 9, 67–96 (1963)

55.

Kripke, S.A.: Semantical analysis of intuitionistic logic. I. In: Formal Systems and Recursive Functions (Proceedings of the Eighth Logic Colloquium, Oxford, 1963), pp. 92–130. North-Holland, Amsterdam (1965)

56.

Kumar, A., Banerjee, M.: Kleene algebras and logic: boolean and rough set representations, 3-valued, rough set and perp semantics. Stud. Logica. 105(3), 439–469 (2017)MathSciNetMATHCrossRef

57.

Li, X.S., Yuan, X.H.: The category \({RSC}\) of \({I}\)-rough sets. In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, vol. 1, pp. 448–452 (2008)

58.

Lindenmayer, A.: Mathematical models for cellular interactions in development I. Filaments with one-sided inputs. J. Theor. Biol. 18(3), 280–299 (1968)CrossRef

59.

Linton, S.A., Pfeiffer, G., Robertson, E.F., Ruškuc, N.: Groups and actions in transformation semigroups. Math. Z. 228(3), 435–450 (1998)MathSciNetMATHCrossRef

60.

Lu, J., Li, S.-G., Yang, X.-F., Fu, W.-Q.: Categorical properties of \(M\)-indiscernibility spaces. Theoret. Comput. Sci. 412(42), 5902–5908 (2011)MathSciNetMATHCrossRef

61.

Mikolajczak, B.: Algebraic and Structural Automata Theory, vol. 44. Elsevier, Amsterdam (1991)MATH

62.

Monro, G.: Quasitopoi, logic and Heyting-valued models. J. Pure Appl. Algebra 42(2), 141–164 (1986)MathSciNetMATHCrossRef

63.

More, A.K., Banerjee, M.: Categories and algebras from rough sets: new facets. Fund. Inform. 148(1–2), 173–190 (2016)MathSciNetMATH

64.

More, A.K., Banerjee, M.: New algebras and logic from a category of rough sets. In: Polkowski, L., et al. (eds.) IJCRS 2017. LNCS (LNAI), vol. 10313, pp. 95–108. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60837-2_8CrossRefMATH

65.

More, A.K., Banerjee, M.: Transformation semigroups for rough sets. In: Nguyen, H.S., Ha, Q.-T., Li, T., Przybyła-Kasperek, M. (eds.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 584–598. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99368-3_46CrossRef

66.

Munkres, J.R.: Topology. Prentice Hall, Hoboken (2000)MATH

67.

Niki, S.: Subminimal logics in light of Vakarelov’s logic. Stud. Logica. 108(5), 967–987 (2020)MathSciNetMATHCrossRef

68.

Nowak, M.: The weakest logic of conditional negation. Bull. Sect. Logic 24(4), 201–205 (1995)MathSciNetMATH

69.

Odintsov, S.P.: The class of extensions of Nelson’s paraconsistent logic. Studia Logica 80(2–3), 291–320 (2005)MathSciNetMATHCrossRef

70.

Odintsov, S.P.: The lattice of extensions of the minimal logic. Siberian Adv. Math. 17(2), 112–143 (2007)MathSciNetCrossRef

71.

Odintsov, S.P.: Constructive Negations and Paraconsistency. Trends in Logic-Studia Logica Library, vol. 26. Springer, New York (2008). https://doi.org/10.1007/978-1-4020-6867-6CrossRefMATH

72.

Pagliani, P.: Rough set theory and logic-algebraic structures. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 109–190. Physica-Verlag, Heidelberg (1998). https://doi.org/10.1007/978-3-7908-1888-8_6CrossRef

73.

Polkowski, L.: Rough Sets: Mathematical Foundations. Advances in Intelligent and Soft Computing, Physica-Verlag HD, Heidelberg (2002). https://doi.org/10.1007/978-3-7908-1776-8CrossRefMATH

74.

Prawitz, D., Malmnäs, P.E.: A survey of some connections between classical, intuitionistic and minimal logic. Stud. Logic Found. Math. 50, 215–229 (1968)MathSciNetMATHCrossRef

75.

Rasiowa, H.: An Algebraic Approach to Non-classical Logics. Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam (1974)MATH

76.

Rasiowa, H., Sikorski, R.: Algebraic treatment of the notion of satisfiability. Fundam. Math. 40, 62–95 (1953)MathSciNetMATHCrossRef

77.

Restall, G.: Defining double negation elimination. Log. J. IGPL 8(6), 853–860 (2000)MathSciNetMATHCrossRef

78.

Segerberg, K.: Propositional logics related to Heyting’s and Johansson’s. Theoria 34, 26–61 (1968)MathSciNetCrossRef

79.

Sharan, S., Srivastava, A.K., Tiwari, S.P.: Characterizations of rough finite state automata. Int. J. Mach. Learn. Cybern. 8(3), 721–730 (2017)CrossRef

80.

Shramko, Y.: Dual intuitionistic logic and a variety of negations: the logic of scientific research. Stud. Logica. 80(2–3), 347–367 (2005)MathSciNetMATHCrossRef

81.

Tiwari, S.P., Sharan, S.: On coverings of rough transformation semigroups. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS (LNAI), vol. 6743, pp. 79–86. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21881-1_14CrossRef

82.

Tiwari, S.P., Sharan, S., Singh, A.K.: On coverings of products of rough transformation semigroups. Int. J. Found. Comput. Sci. 24(03), 375–391 (2013)MathSciNetMATHCrossRef

83.

Tripathy, B.K., Acharjya, D.P., Cynthya, V.: A framework for intelligent medical diagnosis using rough set with formal concept analysis. Int. J. Artif. Intell. Appl. 2(2), 45–66 (2011)

84.

Vakarelov, D.: Notes on \({\cal{N} }\)-lattices and constructive logic with strong negation. Studia Logica 36(1–2), 109–125 (1977)MathSciNetMATHCrossRef

85.

Vakarelov, D.: Consistency, completeness and negation. In: Priest, G., Routley, R., Norman, J. (eds.) Paraconsistent Logic: Essays on the Inconsistent, pp. 328–369. Philosophia Verlag, Munich (1989)CrossRef

86.

Vakarelov, D.: Nelson’s negation on the base of weaker versions of intuitionistic negation. Stud. Logica. 80(2–3), 393–430 (2005)MathSciNetMATHCrossRef

87.

Woodruff, P.W.: A note on JP\(^{\prime }\). Theoria 36(2), 183–184 (1970)MATHCrossRef

88.

Wyler, O.: Lecture Notes on Topoi and Quasitopoi. World Scientific, Singapore (1991)MATHCrossRef

Titel: A Study of Algebraic Structures and Logics Based on Categories of Rough Sets
verfasst von: Anuj Kumar More
Verlag: Springer Berlin Heidelberg
Buch: Transactions on Rough Sets XXIII
Print ISBN: 978-3-662-66543-5

Electronic ISBN: 978-3-662-66544-2

Copyright-Jahr: 2022
DOI: https://doi.org/10.1007/978-3-662-66544-2_9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"