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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bellucci, F., Chiffi, D., Pietarinen, A.V.: Assertive graphs. J. Appl. Non-Class. Log. 28(1), 72–91 (2018)
Burton, J., Stapleton, G., Howse, J.: Completeness proof strategies for euler diagram logics. In: Euler Diagrams 2012, vol. 854, pp. 2–16. CEUR (2012)
Dragalin, A.G.: Mathematical Intuitionism. Introduction to Proof Theory, Translations of Mathematical Monographs, vol. 67. American Mathematical Society (1988)
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
Gentzen, G.: Untersuchungen über das logische Schließen I. Math. Z. 39, 176–210 (1935)
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)
Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS J. Comput. Math. 8, 145–194 (2005)
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
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
Linker, S.: Intuitionistic Euler-Venn-diagrams (extended) (2020). https://arxiv.org/abs/2002.02929
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
Ma, M., Pietarinen, A.V.: A graphical deep inference system for intuitionistic logic. Log. Anal. 245, 73–114 (2019)
Negri, S., von Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)
Ono, H.: Proof Theory and Algebra in Logic. Short Textbooks in Logic. Springer, Singapore (2019)
Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Panstwowe Wydawnictwo Naukowe, Warszaw (1963)
Shin, S.J.: The logical Status of Diagrams. Cambridge University Press, Cambridge (1995)
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)
Stapleton, G., Howse, J., Taylor, J., Thompson, S.: The expressiveness of spider diagrams. J. Log. Comput. 14(6), 857–880 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
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)