Skip to main content

The Expressiveness of Spider Diagrams

Stapleton, Gem, Howse, John, Taylor, John, Thompson, Simon (2004) The Expressiveness of Spider Diagrams. Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X. (doi:10.1093/logcom/14.6.857) (KAR id:14057)

Language: English
Download (262kB) Preview
[thumbnail of 04-14-Stapleton.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
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
DOI/Identification number: 10.1093/logcom/14.6.857
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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01 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):


Downloads per month over past year