Skip to main content

What Can Spider Diagrams Say?

Stapleton, Gem, Howse, John, Taylor, John, Thompson, Simon (2004) What Can Spider Diagrams Say? In: Blackwell, Alan and Marriott, Kim and Shimojima, Atsushi, eds. Diagrammatic Representation and Inference. Lecture Notes in Computer Science , 2980. pp. 179-186. Springer ISBN 3-540-21268-X. (doi:10.1007/978-3-540-25931-2_12) (KAR id:14197)

Language: English
Download (316kB) Preview
[thumbnail of content.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL


Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalent in expressive power to the spider diagram language. The language ESD is monadic and includes equality but has no constants or function symbols. To show this equivalence, in one direction, for each diagram we construct a sentence in ESD that expresses the same information. For the more challenging converse we show there exists a finite set of models for a sentence S that can be used to classify all the models for S. Using these classifying models we show that there is a diagram expressing the same information as S.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1007/978-3-540-25931-2_12
Uncontrolled keywords: Spider diagram expressiveness model theory
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:02 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Thompson, Simon:
  • Depositors only (login required):