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.

Abstract

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.

Item Type: Journal article
Uncontrolled Keywords: Spider diagrams; expressiveness; monadic logic; model theory
Subjects: G000 Computing and Mathematical Sciences
DOI (a stable link to the resource): 10.1093/logcom/14.6.857
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 11 Mar 2011 09:30
Last Modified: 19 Jun 2013 08:36
URI: http://eprints.brighton.ac.uk/id/eprint/8158

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year