What Can Spider Diagrams Say?

Stapleton, Gem and Howse, John and Taylor, John and 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. Springer pp. 179-186. ISBN 3-540-21268-X. (doi:https://doi.org/10.1007/b95854) (Full text available)

PDF
Download (255kB)
Official URL http://dx.doi.org/10.1007/b95854

Abstract

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)
Uncontrolled keywords:	Spider diagram expressiveness 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:02 UTC
Last Modified:	22 Aug 2014 21:10 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/14197 (The current URI for this page, for reference purposes)