Stapleton, G. and Howse, J. and Taylor, J. and Thompson, Simon (2004) The Expressiveness of Spider Diagrams. Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X.
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://dx.doi.org/10.1093/logcom/14.6.857 |
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: | Article |
|---|---|
| Uncontrolled keywords: | spider diagram first order monadic logic equality model theory |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 24 Nov 2008 18:01 |
| Last Modified: | 25 Jun 2012 14:45 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/14057 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
