@inproceedings{305736d5b25b411aa2ac29b2a00541d1,

title = "What can spider diagrams say?",

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.",

author = "Gem Stapleton and John Howse and John Taylor and Simon Thompson",

year = "2004",

month = jan,

day = "1",

doi = "10.1007/978-3-540-25931-2_12",

language = "English",

isbn = "9783540212683",

volume = "2980",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "112--127",

editor = "A. Blackwell and K. Marriott and A. Shimojima",

booktitle = "Proceedings of the 3rd International Conference, Diagrams 2004",

note = "Proceedings of the 3rd International Conference, Diagrams 2004 ; Conference date: 01-01-2004",

}