Skip to main content

Intuitionistic Euler-Venn Diagrams

  • Conference paper
  • First Online:
Diagrammatic Representation and Inference (Diagrams 2020)

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

Included in the following conference series:

Abstract

We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of conjunction, disjunction and intuitionistic implication. Furthermore, we need to add new syntactic elements to express these concepts. We present a cut-free sequent calculus for this language, and prove it to be sound and complete. Furthermore, we show that the rules of cut, weakening and contraction are admissible.

This work was supported by EPSRC Research Programme EP/N007565/1 Science of Sensor Systems Software.

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

References

  1. Bellucci, F., Chiffi, D., Pietarinen, A.V.: Assertive graphs. J. Appl. Non-Class. Log. 28(1), 72–91 (2018)

    Article  MathSciNet  Google Scholar 

  2. Burton, J., Stapleton, G., Howse, J.: Completeness proof strategies for euler diagram logics. In: Euler Diagrams 2012, vol. 854, pp. 2–16. CEUR (2012)

    Google Scholar 

  3. Dragalin, A.G.: Mathematical Intuitionism. Introduction to Proof Theory, Translations of Mathematical Monographs, vol. 67. American Mathematical Society (1988)

    Google Scholar 

  4. de Freitas, R., Viana, P.: A graph calculus for proving intuitionistic relation algebraic equations. In: Cox, P., Plimmer, B., Rodgers, P. (eds.) Diagrams 2012. LNCS (LNAI), vol. 7352, pp. 324–326. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31223-6_40

    Chapter  Google Scholar 

  5. Gentzen, G.: Untersuchungen über das logische Schließen I. Math. Z. 39, 176–210 (1935)

    Article  MathSciNet  Google Scholar 

  6. Hammer, E.: Peircean graphs for propositional logic. In: Allwein, G., Barwise, J. (eds.) Logical Reasoning with Diagrams, pp. 129–147. Oxford University Press, Oxford (1996)

    Google Scholar 

  7. Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS J. Comput. Math. 8, 145–194 (2005)

    Article  MathSciNet  Google Scholar 

  8. Legris, J.: Existential graphs as a basis for structural reasoning. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 590–597. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91376-6_53

    Chapter  Google Scholar 

  9. Linker, S.: Sequent calculus for euler diagrams. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 399–407. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91376-6_37

    Chapter  Google Scholar 

  10. Linker, S.: Intuitionistic Euler-Venn-diagrams (extended) (2020). https://arxiv.org/abs/2002.02929

  11. Ma, M., Pietarinen, A.-V.: A weakening of alpha graphs: quasi-boolean algebras. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 549–564. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91376-6_50

    Chapter  Google Scholar 

  12. Ma, M., Pietarinen, A.V.: A graphical deep inference system for intuitionistic logic. Log. Anal. 245, 73–114 (2019)

    MathSciNet  MATH  Google Scholar 

  13. Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)

    Book  Google Scholar 

  14. Ono, H.: Proof Theory and Algebra in Logic. Short Textbooks in Logic. Springer, Singapore (2019)

    Book  Google Scholar 

  15. Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Panstwowe Wydawnictwo Naukowe, Warszaw (1963)

    MATH  Google Scholar 

  16. Shin, S.J.: The logical Status of Diagrams. Cambridge University Press, Cambridge (1995)

    Book  Google Scholar 

  17. Stapleton, G., Masthoff, J.: Incorporating negation into visual logics: a case study using Euler diagrams. In: VLC 2007, pp. 187–194. Knowledge Systems Institute (2007)

    Google Scholar 

  18. Stapleton, G., Howse, J., Taylor, J., Thompson, S.: The expressiveness of spider diagrams. J. Log. Comput. 14(6), 857–880 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sven Linker .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Linker, S. (2020). Intuitionistic Euler-Venn Diagrams. In: Pietarinen, AV., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds) Diagrammatic Representation and Inference. Diagrams 2020. Lecture Notes in Computer Science(), vol 12169. Springer, Cham. https://doi.org/10.1007/978-3-030-54249-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-54249-8_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-54248-1

  • Online ISBN: 978-3-030-54249-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics