Skip to main content

Tools for the Investigation of Substructural and Paraconsistent Logics

  • Conference paper
Logics in Artificial Intelligence (JELIA 2014)

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

Included in the following conference series:

Abstract

We present an overview of the methods in [10,7,13] and their implementation in the system TINC. This system introduces analytic calculi for large classes of substructural and paraconsistent logics, which it then uses to prove various results about the formalized logics.

Work supported by the FWF project 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.

Similar content being viewed by others

References

  1. Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297–347 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Annals of Mathematics and Artificial Intelligence 4, 225–248 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Avron, A., Konikowska, B., Zamansky, A.: Cut-free sequent calculi for C-systems with generalized finite-valued semantics. Journal of Logic and Computation 21(3), 517–540 (2013)

    Article  MathSciNet  Google Scholar 

  4. Avron, A., Lev, I.: Non-deterministic multiple-valued structures. Journal of Logic and Computation 15(3), 241–261 (2005)

    Article  MathSciNet  Google Scholar 

  5. Baaz, M., Fermüller, C.G., Salzer, G., Zach, R.: MUltlog 1.0: Towards an expert system for many-valued logics. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 226–230. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. Journal of Automated Reasoning 51(4), 401–430 (2013)

    Article  MathSciNet  Google Scholar 

  7. Baldi, P., Ciabattoni, A., Spendier, L.: Standard completeness for extensions of MTL: An automated approach. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 154–167. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Carnielli, W.A., Marcos, J.: A taxonomy of C-systems. In: Carnielli, W.A., Coniglio, M.E., Ottaviano, I.D. (eds.) Paraconsistency: The Logical Way to the Inconsistent, pp. 1–94 (2002)

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  11. Ciabattoni, A., Galatos, N., Terui, K.: MacNeille Completions of FL-algebras. Algebra Universalis 66(4), 405–420 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Annals of Pure and Applied Logic 163(3), 266–290 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Automated support for the investigation of paraconsistent and other logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 119–133. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Taming paraconsistent (and other) logics: An algorithmic approach (submitted 2014)

    Google Scholar 

  15. Ciabattoni, A., Maffezioli, P., Spendier, L.: Hypersequent and labelled calculi for intermediate logics. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol. 8123, pp. 81–96. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Ciabattoni, A., Ramanayake, R.: Structural extensions of display calculi: A general recipe. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 81–95. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Cintula, P., Hájek, P., Noguera, C. (eds.): Handbook of Mathematical Fuzzy Logic, vol. 1. Studies in Logic, Mathematical Logic and Foundations, vol. 37. College Publications (2011)

    Google Scholar 

  18. Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: An algebraic glimpse at substructural logics. Studies in Logics and the Foundations of Mathematics. Elsevier (2007)

    Google Scholar 

  19. Jenei, S., Montagna, F.: A proof of standard completeness for Esteva and Godo’s MTL logic. Studia Logica 70(2), 183–192 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Hájek, P.: Metamathematics of Fuzzy Logic. Springer (1998)

    Google Scholar 

  21. Lahav, O., Zohar, Y.: SAT-based decision procedure for analytic pure sequent calculi. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 76–90. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  22. Metcalfe, G., Montagna, F.: Substructural fuzzy logics. Journal of Symbolic Logic 7(3), 834–864 (2007)

    Article  MathSciNet  Google Scholar 

  23. Nigam, V., Pimentel, E., Reis, G.: An extended framework for specifying and reasoning about proof systems. Journal of Logic and Computation (accepted)

    Google Scholar 

  24. Ohlbach, H.J.: Computer support for the development and investigation of logics. Logic Journal of the IGPL 4(1), 109–127 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  25. Tishkovsky, D., Schmidt, R.A., Khodadadi, M.: The tableau prover generator MetTeL2. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 492–495. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  26. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (2000)

    Google Scholar 

  27. Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 33–38. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ciabattoni, A., Spendier, L. (2014). Tools for the Investigation of Substructural and Paraconsistent Logics. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11558-0_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11557-3

  • Online ISBN: 978-3-319-11558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics