Sequent calculus for euler diagrams

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Proof systems play a major role in the formal study of diagrammatic logical systems. Typically, the style of inference is not directly comparable to traditional sentential systems, to study the diagrammatic aspects of inference. In this work, we present a proof system for Euler diagrams with shading in the style of sequent calculus. We prove it to be sound and complete. Furthermore we outline how this system can be extended to incorporate heterogeneous logical descriptions. Finally, we explain how small changes allow for reasoning with intuitionistic logic.

Cite

CITATION STYLE

APA

Linker, S. (2018). Sequent calculus for euler diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10871 LNAI, pp. 399–407). Springer Verlag. https://doi.org/10.1007/978-3-319-91376-6_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free