### Abstract

Original language | English |
---|---|

Title of host publication | Proceedings of the 3rd International Conference, Diagrams 2004 |

Editors | A. Blackwell, K. Marriott, A. Shimojima |

Place of Publication | Berlin Heidelberg |

Publisher | Springer |

Pages | 112-127 |

Number of pages | 16 |

Volume | 2980 |

ISBN (Electronic) | 9783540259312 |

ISBN (Print) | 9783540212683 |

DOIs | |

Publication status | Published - 1 Jan 2004 |

Event | Proceedings of the 3rd International Conference, Diagrams 2004 - Cambridge, UK, 22-24 March, 2004 Duration: 1 Jan 2004 → … |

### Publication series

Name | Lecture Notes in Computer Science |
---|

### Conference

Conference | Proceedings of the 3rd International Conference, Diagrams 2004 |
---|---|

Period | 1/01/04 → … |

### Cite this

*Proceedings of the 3rd International Conference, Diagrams 2004*(Vol. 2980, pp. 112-127). (Lecture Notes in Computer Science). Berlin Heidelberg: Springer. https://doi.org/10.1007/978-3-540-25931-2_12

}

*Proceedings of the 3rd International Conference, Diagrams 2004.*vol. 2980, Lecture Notes in Computer Science, Springer, Berlin Heidelberg, pp. 112-127, Proceedings of the 3rd International Conference, Diagrams 2004, 1/01/04. https://doi.org/10.1007/978-3-540-25931-2_12

**What can spider diagrams say?** / Stapleton, Gem; Howse, John; Taylor, John; Thompson, Simon.

Research output: Chapter in Book/Conference proceeding with ISSN or ISBN › Conference contribution with ISSN or ISBN

TY - GEN

T1 - What can spider diagrams say?

AU - Stapleton, Gem

AU - Howse, John

AU - Taylor, John

AU - Thompson, Simon

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-25931-2_12

DO - 10.1007/978-3-540-25931-2_12

M3 - Conference contribution with ISSN or ISBN

SN - 9783540212683

VL - 2980

T3 - Lecture Notes in Computer Science

SP - 112

EP - 127

BT - Proceedings of the 3rd International Conference, Diagrams 2004

A2 - Blackwell, A.

A2 - Marriott, K.

A2 - Shimojima, A.

PB - Springer

CY - Berlin Heidelberg

ER -