The expressiveness of spider diagrams
STAPLETON, GEM, HOWSE, JOHN, TAYLOR, JOHN and Thompson, Simon (2004) The expressiveness of spider diagrams Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X
Full text not available from this repository.
Official URL: http://logcom.oxfordjournals.org/content/14/6/857....
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.
Repository Staff Only: item control page