Skip to main content

Part of the book series: Logic, Epistemology, and the Unity of Science ((LEUS,volume 40))

  • 429 Accesses

Abstract

This chapter deals with several extensions of mbC, which by its turn is a minimal extension of positive classical logic by means of a consistency operator and a paraconsistent negation. Important topics studied are consistency and inconsistency as derived connectives, inconsistency operators, as well as N. da Costa’s Hierarchy and consistency propagation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    In general, names of logic systems are acronyms for the names of the axioms involved.

  2. 2.

    As it was done above, to simplify notation, the index \(\beta \) will kept fixed in the statement and in the proof of this proposition. Of course this abuse of notation does not affect the validity of the claims, because of the properties of \(\bot _{\beta (\alpha )}\), \({\sim }_{\beta (\alpha )}\) and \({\circ }_{\beta (\alpha )}\).

  3. 3.

    As a concrete example of this situation, consider the expansion \(C_2^{\sim }\) of da Costa’s system \(C_2\) (see Sect. 3.7) obtained by adding a primitive connective for the classical negation \({\sim }\), where \({\circ }_1 p\) and \({\circ }_2 p\) are formulas which only use \(\wedge \) and \(\lnot \), and where the formula \(\psi (p_1,p_2)\) is \({\sim }(p_1 \rightarrow \sim p_2)\).

References

  1. Carnielli, Walter A., Marcelo E. Coniglio, and João Marcos. 2007. Logics of Formal Inconsistency. In Handbook of Philosophical Logic, ed. Dov M. Gabbay and Franz Guenthner (2nd. edn.), vol. 14, 1–93. Springer. doi:10.1007/978-1-4020-6324-4_1.

    Google Scholar 

  2. Avron, Arnon. 2005. Non-deterministic matrices and modular semantics of rules. In Logica Universalis, ed. Jean-Y. Béziau, 149–167. Basel: Birkhäuser Verlag.

    Google Scholar 

  3. Carnielli, Walter A., and João Marcos. A taxonomy of C-systems. In [Carnielli, Walter A., Marcelo E. Coniglio, and Itala M. L. D’Ottaviano, eds. 2002. Paraconsistency: The Logical Way to the Inconsistent. Proceedings of the 2nd World Congress on Paraconsistency (WCP 2000), Vol. 228 of Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, New York], 1–94.

    Google Scholar 

  4. Avron, Arnon, Beata Konikowska, and Anna Zamansky. 2011. Analytic calculi for basic logics of formal inconsistency. In Logic without Frontiers: Festschrift for Walter Alexandre Carnielli on the occasion of his 60th birthday, ed. Jean-Yves Beziau and Marcelo Esteban Coniglio, vol. 17 of Tribute Series, 265–275. College Publications.

    Google Scholar 

  5. Avron, Arnon, Beata Konikowska, and Anna Zamansky. Modular construction of cut-free sequent calculi for paraconsistent logics. In Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, 85–94. IEEE, 2012. doi:10.1109/LICS.2012.20.

  6. Avron, Arnon, Beata Konikowska, and Anna Zamansky. 2013. Cut-free sequent calculi for C-systems with generalized finite-valued semantics. Journal of Logic and Computation 23(3): 517–540. doi:10.1093/logcom/exs039.

    Article  Google Scholar 

  7. Avron, Arnon, Beata Konikowska, and Anna Zamansky. 2015. Efficient reasoning with inconsistent information using C-systems. Information Sciences 296: 219–236. doi:10.1016/j.ins.2014.11.003.

    Article  Google Scholar 

  8. Batens, Diderik. 1980. Paraconsistent extensional propositional logics. Logique et Analyse 90–91: 195–234.

    Google Scholar 

  9. Marcos, João. 2008. Possible-translations semantics for some weak classically-based paraconsistent logics. Journal of Applied Non-Classical Logics 18(1): 7–28.

    Article  Google Scholar 

  10. Newton C. A. da Costa. 1993. Sistemas formais inconsistentes (Inconsistent formal systems, in Portuguese). Habilitation thesis, Universidade Federal do Paraná, Curitiba, Brazil, 1963. Republished by Editora UFPR, Curitiba, Brazil, 1993.

    Google Scholar 

  11. Loparić, Andréa. 1986. A semantical study of some propositional calculi. The Journal of Non-Classical Logic, 3(1):73–95. http://www.cle.unicamp.br/jancl/.

  12. Baaz, Matthias. 1986. Kripke-type semantics for da Costa’s paraconsistent logic \({C}_\omega \). Notre Dame Journal of Formal Logic 27(4): 523–527.

    Article  Google Scholar 

  13. da Costa, Newton C.A. and Elias H. Alves. 1976. Une sémantique pour le calcul \({C}_1\) (in French). In Comptes Rendus de l’Académie de Sciences de Paris (A-B), 283:729–731.

    Google Scholar 

  14. da Costa, Newton C.A., and Elias H. Alves. 1977. A semantical analysis of the calculi \({C}_n\). Notre Dame Journal of Formal Logic 18(4): 621–630.

    Article  Google Scholar 

  15. Loparić, Andréa and Elias H. Alves. The semantics of the systems \({C}_n\) of da Costa. In [Arruda, Ayda I., Newton C. A. da Costa, and Antonio M. A. Sette, eds. 1980. Proceedings of the Third Brazilian Conference on MathematicalLogic, Recife 1979. Sociedade Brasileira de Logica, Campinas], 161–172.

    Google Scholar 

  16. Carnielli, Walter A., and João Marcos. 1999. Limits for paraconsistent calculi. Notre Dame Journal of Formal Logic 40(3): 375–390.

    Article  Google Scholar 

  17. Béziau, Jean-Yves. 1990. Logiques construites suivant les méthodes de da Costa. I. Logiques paraconsistantes, paracompletes, non-alèthiques construites suivant la première méthode de da Costa (in French). Logique et Analyse (N.S.), 131/132:259–272.

    Google Scholar 

  18. da Costa, Newton C. A, Jean-Yves Béziau, and Otávio Bueno. 1995. Aspects of paraconsistent logic. Bulletin of the IGPL, 3(4):597–614.

    Google Scholar 

  19. Font, Josep Maria, and Ramón Jansana. 2009. A General Algebraic Semantics for Sentential Logics. Vol. 7 of Lecture Notes in Logic, 2nd edn. Ithaca, NY, USA: Association for Symbolic Logic.

    Google Scholar 

  20. Bueno-Soler, Juliana, and Walter A. Carnielli. 2005. Possible-translations algebraization for paraconsistent logics. Bulletin of the Section of Logic 34(2): 77–92.

    Google Scholar 

  21. Bueno-Soler, Juliana, Marcelo E. Coniglio, and Walter A. Carnielli. 2007. Possible-translations algebraizability. In Handbook of paraconsistency Jean-Yves Béziau, Walter A. Carnielli, and Dov M. Gabbay, editors, vol. 9 of Studies in logic (Logic & Cognitive Systems), 321–340. College Publications.

    Google Scholar 

  22. Caleiro, Carlos, and Ricardo Gonçalves. 2009. Behavioral algebraization of da Costa’s C-systems. Journal of Applied Non-Classical Logics 19(2): 127–148.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Walter Carnielli .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Carnielli, W., Coniglio, M.E. (2016). Some Extensions of mbC. In: Paraconsistent Logic: Consistency, Contradiction and Negation. Logic, Epistemology, and the Unity of Science, vol 40. Springer, Cham. https://doi.org/10.1007/978-3-319-33205-5_3

Download citation

Publish with us

Policies and ethics