What can spider diagrams say?

Gem Stapleton, John Howse, John Taylor, Simon Thompson

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

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.
Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference, Diagrams 2004
EditorsA. Blackwell, K. Marriott, A. Shimojima
Place of PublicationBerlin Heidelberg
PublisherSpringer
Pages112-127
Number of pages16
Volume2980
ISBN (Electronic)9783540259312
ISBN (Print)9783540212683
DOIs
Publication statusPublished - 1 Jan 2004
EventProceedings of the 3rd International Conference, Diagrams 2004 - Cambridge, UK, 22-24 March, 2004
Duration: 1 Jan 2004 → …

Publication series

NameLecture Notes in Computer Science

Conference

ConferenceProceedings of the 3rd International Conference, Diagrams 2004
Period1/01/04 → …

Cite this