Spider Diagrams
Open Access
- 1 January 2005
- journal article
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 8, 145-194
Abstract
The use of diagrams in mathematics has traditionally been restricted to guiding intuition and communication. With rare exceptions such as Peirce's alpha and beta systems, purely diagrammatic formal reasoning has not been in the mathematician's or logician's toolkit. This paper develops a purely diagrammatic reasoning system of “spider diagrams” that builds on Euler, Venn and Peirce diagrams. The system is known to be expressively equivalent to first-order monadic logic with equality. Two levels of diagrammatic syntax have been developed: an ‘abstract’ syntax that captures the structure of diagrams, and a ‘concrete’ syntax that captures topological properties of drawn diagrams. A number of simple diagrammatic transformation rules are given, and the resulting reasoning system is shown to be sound and complete.Keywords
This publication has 13 references indexed in Scilit:
- A Decidable Constraint Diagram Reasoning SystemJournal of Logic and Computation, 2005
- The semantics of augmented constraint diagramsJournal of Visual Languages & Computing, 2005
- The Expressiveness of Spider DiagramsJournal of Logic and Computation, 2004
- Nesting in Euler Diagrams: syntax, semantics and constructionSoftware and Systems Modeling, 2004
- Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider DiagramsLecture Notes in Computer Science, 2004
- Ensuring the Drawability of Extended Euler Diagrams for up to 8 SetsLecture Notes in Computer Science, 2004
- Spider Diagrams: A Diagrammatic Reasoning SystemJournal of Visual Languages & Computing, 2001
- On the Completeness and Expressiveness of Spider Diagram SystemsLecture Notes in Computer Science, 2000
- Constraint diagramsACM SIGPLAN Notices, 1997
- I. On the diagrammatic and mechanical representation of propositions and reasoningsJournal of Computers in Education, 1880