Skip to main content

Natural Deduction for Intuitionistic Euler-Venn Diagrams

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

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

Included in the following conference series:

  • 1144 Accesses

Abstract

We present preliminary results for a proof system based on Natural Deduction for intuitionistic Euler-Venn diagrams. These diagrams are our building blocks to visualise intuitionistic arguments, that is, arguments avoiding classical Boolean arguments, for example “proof by contradiction” or the “law of the excluded middle”. We have previously presented semantics for these diagrams and a proof system in the style of Sequent Calculus. Within this proof system, proof search consists of gradually decomposing the diagram to prove. While such a style is easy to automate, it is not very intuitive for human reasoners. Since formalising human reasoning was the main intention behind Natural Deduction, we choose this style for a proof system that is easier to apply and to understand than the existing system.

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

Notes

  1. 1.

    The lattice operations reflect the logical operators: the meet \(\sqcap \) is the algebraic equivalent to conjunction \(\wedge \), the join \(\sqcup \) to disjunction \(\vee \), and the algebraic implication \(\mapsto \) corresponds to logical implication \(\rightarrow \). The complement \(- \mathbf {a}\) is defined by \(\mathbf {a} \mapsto 0\) (where \(0\) is the bottom element of the algebra), and corresponds to negation.

  2. 2.

    \(\varGamma \vdash d\) means that using the diagrams in \(\varGamma \) as assumptions, we can prove \(d\).

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Linker, S.: Intuitionistic Euler-Venn diagrams. In: Pietarinen, A.-V., Chapman, P., Bosveld-de Smet, L., Giardino, V., Corter, J., Linker, S. (eds.) Diagrams 2020. LNCS (LNAI), vol. 12169, pp. 264–280. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-54249-8_21

    Chapter  Google Scholar 

  4. Ma, M., Pietarinen, A.V.: A graphical deep inference system for intuitionistic logic. Logique et Anal. (N.S.) 245, 73–114 (2019)

    MathSciNet  MATH  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

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Linker, S. (2021). Natural Deduction for Intuitionistic Euler-Venn Diagrams. In: Basu, A., Stapleton, G., Linker, S., Legg, C., Manalo, E., Viana, P. (eds) Diagrammatic Representation and Inference. Diagrams 2021. Lecture Notes in Computer Science(), vol 12909. Springer, Cham. https://doi.org/10.1007/978-3-030-86062-2_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86062-2_54

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86061-5

  • Online ISBN: 978-3-030-86062-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics