Abstract
We present syntax and semantics of a diagrammatic language based on Venn diagrams in which a diagram is not read as a statement about sets, but as a set itself. We prove that our set of rules is sound and complete with respect to the intended semantics. Our system has two slight advantages in relation to the systems we usually encounter in the literature. First, the drawing of diagrams for terms is made inside the system, i.e., by a completely mechanical process based just on the rules of the system. Second, as a consequence, the validity of an inclusion is also verified inside the system and does not depend on any other means than those afforded by our set of rules. These characteristics are absent in the majority of the Venn diagrammatic systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Burton, J., Stapleton, G., Howse, J.: Completeness proof strategies for Euler diagram logics. In: Chapman, P., Micallef, L. (eds.) Euler Diagrams 2012: Proceedings of the 3rd International Workshop on Euler Diagrams, Canterbury, UK, July 2 (2012)
Halmos, P.: Naive Set Theory. Springer, New York (1974)
Hammer, E., Danner, N.: Towards a model theory of Venn diagrams. J. Philos. Logic 25, 463–482 (1996)
Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1994)
Stewart, I.: The truth about Venn diagrams. Math. Gaz. 70, 47–54 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Freitas, R., Viana, P. (2014). The Second Venn Diagrammatic System. In: Dwyer, T., Purchase, H., Delaney, A. (eds) Diagrammatic Representation and Inference. Diagrams 2014. Lecture Notes in Computer Science(), vol 8578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44043-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-662-44043-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44042-1
Online ISBN: 978-3-662-44043-8
eBook Packages: Computer ScienceComputer Science (R0)