Proof-Theoretical Investigation of Venn Diagrams: A Logic Translation and Free Rides
In the literature on diagrammatic reasoning, Venn diagrams are abstractly formalized in terms of minimal regions. In view of the cognitive process to recognize Venn diagrams, we modify slightly the formalization by distinguishing conjunctive, negative, and disjunctive regions among possible regions in Venn diagrams. Then we study a logic translation of the Venn diagrammatic system with the aim of investigating how our inference rules are rendered to resolution calculus. We further investigate the free ride property of the Venn diagrammatic system. Free ride is one of the most basic properties of diagrammatic systems and it is mainly discussed in cognitive science literature as an account of the inferential efficacy of diagrams. The soundness of our translation shows that a free ride occurs between the Venn diagrammatic system and resolution calculus. Furthermore, our translation provides a more in-depth analysis of the free ride. In particular, we calculate how many pieces of information are obtained in the manipulation of Venn diagrams.
KeywordsInference Rule Venn Diagram Free Ride Natural Deduction Proof Theory
Unable to display preview. Download preview PDF.
- 1.Barwise, J., Seligman, J.: Information Flow: The Logic of Distributed Systems. Cambridge University Press (1997)Google Scholar
- 2.Buss, S.R.: An Introduction to Proof Theory. In: Buss, S.R. (ed.) Handbook Proof Theory. Elsevier, Amsterdam (1998)Google Scholar
- 5.Mineshima, K., Okada, M., Takemura, R.: A Diagrammatic Inference System with Euler Circles. Journal of Logic, Language and Information (to appear), A preliminary version is available at: http://abelard.flet.keio.ac.jp/person/takemura/index.html
- 9.Shimojima, A.: On the Efficacy of Representation, Ph.D. thesis, Indiana University (1996)Google Scholar
- 10.Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press (1994)Google Scholar
- 11.Stapleton, G.: A survey of reasoning systems based on Euler diagrams. In: Proc. of Euler 2004. Electronic Notes in Theoretical Computer Science, vol. 134(1), pp. 127–151 (2005)Google Scholar
- 12.Takemura, R.: Proof theory for reasoning with Euler diagrams: a logic translation and normalization. Studia Logica (to appear), A preliminary version is available at: http://abelard.flet.keio.ac.jp/person/takemura/index.html