Skip to main content
SpringerLink
Log in

Paraconsistent Logics: A Survey Focussing on the Rough Set Approach

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14481))

Included in the following conference series:

  • 167 Accesses

Abstract

A survey of approaches yielding paraconsistent logics is made and is summarised through a diagram. The rough set theoretic approach is included in the survey, and it is the focus in the second part of the work. Several new paraconsistent systems are presented, that are obtained by weakening existing rough modus ponens rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The consequence relation \(\vdash \) is used as a meta-linguistic symbol. In the context of a particular logic this can be a relation obtained semantically or syntactically; moreover sometimes the same notion of consequence is represented by an operator from \(\mathcal {P}(FOR)\) to \(\mathcal {P}(FOR)\). The use of notation would be clear from the contexts.

  2. 2.

    This notion is more formally introduced in Sect. 3.1.

  3. 3.

    A subset \(\varGamma \subseteq FOR\) is said to be trivial if \(\varGamma \vdash \alpha \) for every formula \(\alpha \), otherwise it is called non-trivial.

  4. 4.

    The logic CLuN, developed by Diderik Batens, is a predicative paraconsistent logic. The propositional part of CLuN is obtained by adding the axiom-schema \((\alpha \rightarrow \lnot \alpha ) \rightarrow \lnot \alpha \) to \(CPL^{+}\). The adaptive logic CLuN\(^{m}\) is obtained from CLuN based on a strategy, called minimal abnormality..

References

  1. Arruda, A.I.: A survey of paraconsistent logic. In: Arruda, A., Chuaqui, R., Da Costa, N. (eds.) Mathematical Logic in Latin America. Studies in Logic and the Foundations of Mathematics, vol. 99. pp. 1–41. Elsevier (1980)

    Google Scholar 

  2. Avron, A.: Natural \(3\)-valued logics-characterization and proof theory. J. Symbolic Logic 56(1), 276–294 (1991)

    Article  MathSciNet  Google Scholar 

  3. Avron, A., Konikowska, B.: Rough sets and 3-valued logics. Stud. Logica. 90(1), 69–92 (2008)

    Article  MathSciNet  Google Scholar 

  4. Banerjee, M.: Rough sets and \(3\)-valued Łukasiewicz logic. Fund. Inform. 31(3–4), 213–220 (1997)

    MathSciNet  Google Scholar 

  5. Banerjee, M.: Logic for rough truth. Fund. Inform. 71(2–3), 139–151 (2006)

    MathSciNet  Google Scholar 

  6. Banerjee, M., Chakraborty, M.K.: Rough consequence. Bull. Polish Acad. Sci. (Math.) 41(4), 299–304 (1993)

    MathSciNet  Google Scholar 

  7. Basu, S.S., Chakraborty, M.K.: Restricted rules of inference and paraconsistency. Log. J. IGPL 30(3), 534–560 (2022)

    Article  MathSciNet  Google Scholar 

  8. Batens, D.: Paraconsistent extensional propositional logics. Logique Anal. 23(90–91), 195–234 (1980)

    MathSciNet  Google Scholar 

  9. Batens, D.: A universal logic approach to adaptive logics. Log. Univers. 1(1), 221–242 (2007)

    Article  MathSciNet  Google Scholar 

  10. Batens, D.: Tutorial on inconsistency-adaptive logics. In: Beziau, J.-Y., Chakraborty, M., Dutta, S. (eds.) New Directions in Paraconsistent Logic. SPMS, vol. 152, pp. 3–38. Springer, New Delhi (2015). https://doi.org/10.1007/978-81-322-2719-9_1

    Chapter  Google Scholar 

  11. Batens, D., De Clercq, K.: A rich paraconsistent extension of full positive logic. Logique Anal. 47(185/188), 227–257 (2004)

    MathSciNet  Google Scholar 

  12. Batens, D., De Clercq, K., Kurtonina, N.: Embedding and interpolation for some paralogics. The propositional case. Rep. Math. Log. 33, 29–44 (1999)

    MathSciNet  Google Scholar 

  13. Belnap Jr, N.D.: A useful four-valued logic. In: Dunn, J.M., Epstein, G. (eds.), Modern Uses of Multiple-valued Logic. Episteme, vol. 2, pp. 5–37. Springer, Dordrecht (1977). https://doi.org/10.1007/978-94-010-1161-7_2

  14. Boicescu, V., Filipoiu, A., Georgescu, G., Rudeanu, S.: Łukasiewicz-Moisil Algebras. North Holland (1991)

    Google Scholar 

  15. Bonzio, S., Moraschini, T., Pra Baldi, M.: Logics of left variable inclusion and Płonka sums of matrices. Arch. Math. Logic 60(1–2), 49–76 (2021)

    Google Scholar 

  16. Bonzio, S., Paoli, F., Pra Baldi, M.: Logics of variable inclusion. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-04297-3

  17. Bunder, M.W., Banerjee, M., Chakraborty, M.K.: Some rough consequence logics and their interrelations. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 1–20. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85064-9_1

    Chapter  Google Scholar 

  18. Carnielli, W., Coniglio, M.E., Marcos, J.: Logics of formal inconsistency. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 14, pp. 1–93. Springer, Dordrecht (2007). https://doi.org/10.1007/978-1-4020-6324-4_1

  19. Carnielli, W., Coniglio, M.E.: Paraconsistent Logic: Consistency, Contradiction and Negation. LEUS, vol. 40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-33205-5

    Book  Google Scholar 

  20. Carnielli, W.A., Marcos, J.: A taxonomy of \({ C}\)-systems. In: Carnielli, W.A., Marcelo, C., D’ottaviano, I.M.L. (eds.) Paraconsistency, vol. 228, pp. 1–94. Dekker, New York (2002)

    Chapter  Google Scholar 

  21. Ciucci, D., Dubois, D.: Three-valued logics, uncertainty management and rough sets. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets XVII. LNCS, vol. 8375, pp. 1–32. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54756-0_1

    Chapter  Google Scholar 

  22. da Costa, N.C.A., Alves, E.H.: A semantical analysis of the calculi \({ C}_{n}\). Notre Dame J. Formal Logic 18(4), 621–630 (1977)

    MathSciNet  Google Scholar 

  23. da Costa, N.C.A., Doria, F.A.: On Jaśkowski’s discussive logics. Stud. Logica. 54(1), 33–60 (1995)

    Article  Google Scholar 

  24. da Costa, N.C.A., Krause, D., Bueno, O.: Paraconsistent logics and paraconsistency. In: Jacquette, D. (ed.) Philosophy of Logic. Handbook of the Philosophy of Science, pp. 791–911. North-Holland, Amsterdam (2007)

    Google Scholar 

  25. de Souza, E.G., Costa-Leite, A., Dias, D.H.B.: On a paraconsistentization functor in the category of consequence structures. J. Appl. Non-Class. Log. 26(3), 240–250 (2016)

    Article  MathSciNet  Google Scholar 

  26. Dutta, S., Chakraborty, M.K.: Consequence–inconsistency interrelation: in the framework of paraconsistent logics. In: Beziau, J.-Y., Chakraborty, M., Dutta, S. (eds.) New Directions in Paraconsistent Logic. SPMS, vol. 152, pp. 269–283. Springer, New Delhi (2015). https://doi.org/10.1007/978-81-322-2719-9_12

    Chapter  Google Scholar 

  27. Hughes, G.E., Cresswell, M.J.: A New Introduction to Modal Logic. Routledge, Milton Park (1996)

    Google Scholar 

  28. Iturrioz, L.: Rough sets and three-valued structures. In: Orłowska, E. (ed.) Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa. Studies in Fuzziness and Soft Computing, vol. 24, pp. 596–603. Physica, Heidelberg (1999)

    Google Scholar 

  29. Kotas, J.: The axiomatization of S. Jaśkowski’s discussive system. Stud. Logica 33, 195–200 (1974)

    Article  MathSciNet  Google Scholar 

  30. Malinowski, G.: Kleene logic and inference. Bull. Sect. Logic 43(1/2), 43–52 (2014)

    MathSciNet  Google Scholar 

  31. Middelburg, C.A.: A survey of paraconsistent logics. arXiv preprint arXiv:1103.4324 (2011)

  32. Nakayama, Y., Akama, S., Murai, T.: Four-valued tableau calculi for decision logic of rough set. Procedia Comput. Sci. 126, 383–392 (2018)

    Article  Google Scholar 

  33. Omori, H., Wansing, H.: 40 years of FDE: an introductory overview. Stud. Logica. 105(6), 1021–1049 (2017)

    Article  MathSciNet  Google Scholar 

  34. Pagliani, P.: Rough set theory and logic-algebraic structures. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol. 13, pp. 109–190. Physica, Heidelberg (1998). https://doi.org/10.1007/978-3-7908-1888-8_6

    Chapter  Google Scholar 

  35. Pawlak, Z.: Rough sets. Internat. J. Comput. Inform. Sci. 11(5), 341–356 (1982)

    Article  MathSciNet  Google Scholar 

  36. Pawlak, Z.: Rough logic. Bull. Polish Acad. Sci. (Tech. Sci.) 35(5–6), 253–258 (1987)

    Google Scholar 

  37. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Amsterdam (1991)

    Google Scholar 

  38. Priest, G.: Paraconsistent logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 6, pp. 287–393. Springer, Netherlands, Dordrecht (2002). https://doi.org/10.1007/978-94-017-0460-1_4

  39. Priest, G.: Plurivalent logics. Australas. J. Log. 11(1), 2–13 (2014)

    MathSciNet  Google Scholar 

  40. Priest, G., Routley, R.: Introduction: paraconsistent logics. Stud. Logica. 43(1–2), 3–16 (1984)

    Article  MathSciNet  Google Scholar 

  41. Robles, G.: A Routley-Meyer semantics for Gödel 3-valued logic and its paraconsistent counterpart. Log. Univers. 7, 507–532 (2013)

    Article  MathSciNet  Google Scholar 

  42. Shramko, Y., Zaitsev, D., Belikov, A.: First-degree entailment and its relatives. Stud. Logica. 105(6), 1291–1317 (2017)

    Article  MathSciNet  Google Scholar 

  43. Smiley, T.J.: Entailment and deducibility. Proc. Aristot. Soc. 59, 233–254 (1959)

    Article  Google Scholar 

  44. Tsoukiàs, A.: A first order, four-valued, weakly paraconsistent logic and its relation with rough sets semantics. Found. Comput. Decision Sci. 27(2), 77–96 (2002)

    MathSciNet  Google Scholar 

  45. Tuziak, R.: Paraconsistent extensions of positive logic. Bull. Sect. Logic 25(1), 15–20 (1996)

    MathSciNet  Google Scholar 

  46. Viana, H., Alcântara, J.A., Martins, A.T.: Searching contexts in paraconsistent rough description logic. J. Braz. Comput. Soc. 21(1), Art. 7, 13 (2015)

    Google Scholar 

  47. Vitória, A., Małuszyński, J., Szałas, A.: Modeling and reasoning with paraconsistent rough sets. Fund. Inform. 97(4), 405–438 (2009)

    MathSciNet  Google Scholar 

  48. Vitória, A., Szałas, A., Małuszyński, J.: Four-valued extension of rough sets. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 106–114. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79721-0_19

    Chapter  Google Scholar 

  49. Wu, H.: Paraconsistent rough set algebras. In: Chen, Y., Zhang, S. (eds.) AILA 2022. Communications in Computer and Information Science, vol. 1657, pp. 166–179. Springer, Singapore (2022). https://doi.org/10.1007/978-981-19-7510-3_13

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, Kanpur, India

    Bidhan Saha & Mohua Banerjee

  2. Department of Mathematics and Computer Science, University of Warmia and Mazury, Olsztyn, Poland

    Soma Dutta

Authors
  1. Bidhan Saha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohua Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Soma Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bidhan Saha .

Editor information

Editors and Affiliations

  1. IRCCS Istituto Ortopedico Galeazzi, Milano, Italy

    Andrea Campagner

  2. Ghent University, Ghent, Belgium

    Oliver Urs Lenz

  3. Chongqing University of Posts and Telecommunications, Chongqing, China

    Shuyin Xia

  4. University of Warsaw, Warsaw, Poland

    Dominik Ślęzak

  5. AGH University of Science and Technology, Kraków, Poland

    Jarosław Wąs

  6. University of Regina, Regina, SK, Canada

    JingTao Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Saha, B., Banerjee, M., Dutta, S. (2023). Paraconsistent Logics: A Survey Focussing on the Rough Set Approach. In: Campagner, A., Urs Lenz, O., Xia, S., Ślęzak, D., Wąs, J., Yao, J. (eds) Rough Sets. IJCRS 2023. Lecture Notes in Computer Science(), vol 14481. Springer, Cham. https://doi.org/10.1007/978-3-031-50959-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-50959-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-50958-2

  • Online ISBN: 978-3-031-50959-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation