Skip to main content

Automated Support for the Investigation of Paraconsistent and Other Logics

  • Conference paper
Logical Foundations of Computer Science (LFCS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7734))

Included in the following conference series:

Abstract

We automate the construction of analytic sequent calculi and effective semantics for a large class of logics formulated as Hilbert calculi. Our method applies to infinitely many logics, which include the family of paraconsistent C-systems, as well as to other logics for which neither analytic calculi nor suitable semantics have so far been available.

Work supported by the Israel Science Foundation (grant no. 280-10), the EC Marie Curie Fellowship (NDMANCL-252314), and FWF START Y544-N23.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avron, A.: Logical non-determinism as a tool for logical modularity: An introduction. In: We Will Show Them: Essays in Honor of Dov Gabbay, pp. 105–124. College Publications (2005)

    Google Scholar 

  2. Avron, A.: Non-deterministic Semantics for Families of Paraconsistent Logics. In: Handbook of Paraconsistency. Studies in Logic, vol. 9, pp. 285–320. College Publications (2007)

    Google Scholar 

  3. Avron, A., Ben-Naim, J., Konikowska, B.: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics. Logica Universalis 1, 41–69 (2006)

    Article  MathSciNet  Google Scholar 

  4. Avron, A., Konikowska, B., Zamansky, A.: Modular construction of cut-free sequent calculi for paraconsistent logics. In: Proceedings of LICS 2012, pp. 85–94. IEEE (2012)

    Google Scholar 

  5. Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems - A survey. In: Gabbay, D., Guenther, F. (eds.) Handbook of Philosophical Logic, vol. 16, pp. 227–304. Springer (2011)

    Google Scholar 

  6. Baaz, M., Lahav, O., Zamansky, A.: Effective finite-valued semantics for labelled calculi. In: Proceedings of IJCAR 2012, pp. 52–66 (2012)

    Google Scholar 

  7. Carnielli, W.A., Coniglio, M.E., Marcos, J.: Logics of formal inconsistency. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 14, 2nd edn., pp. 15–107. Springer (2007)

    Google Scholar 

  8. Carnielli, W.A., Marcos, J.: A taxonomy of C-systems. In: Carnielli, W.A., Coniglio, M.E., D’Ottaviano, I. (eds.) Paraconsistency: The Logical Way to the Inconsistent. Lecture Notes in Pure and Applied Mathematics, vol. 228, pp. 1–94. Marcel Dekker (2002)

    Google Scholar 

  9. Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: Proceedings of LICS 2008, pp. 229–240. IEEE (2008)

    Google Scholar 

  10. da Costa, N.C.A.: On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic 15, 497–510 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ohlbach, J.: Computer support for the development and investigation of logics. Journal of the IGPL 4, 109–127 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A. (2013). Automated Support for the Investigation of Paraconsistent and Other Logics. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2013. Lecture Notes in Computer Science, vol 7734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35722-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35722-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35721-3

  • Online ISBN: 978-3-642-35722-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics