The Expressiveness of Spider Diagrams

Stapleton, Gem and Howse, John and Taylor, John and Thompson, Simon (2004) The Expressiveness of Spider Diagrams. Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X. (doi: (Full text available)

Download (326kB) Preview
Official URL


Spider diagrams are a visual language for expressing logical statements. In this paper we identify a well-known fragment of first-order predicate logic that we call MFOL=, equivalent in expressive power to the spider diagram language. The language MFOL= 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 MFOL=, that expresses the same information. For the more challenging converse we prove that 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: Article
Uncontrolled keywords: spider diagram first order monadic logic equality model theory
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 UTC
Last Modified: 22 Aug 2014 21:06 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year