A Substructural Logic for Layered Graphs

Matthew Collinson, Kevin McDonald, David Pym

Research output: Contribution to journalArticle

Abstract

Complex systems, be they natural or synthetic, are ubiquitous. In particular, complex networks of devices and services underpin most of society's operations. By their very nature, such systems are difficult to conceptualize and reason about effectively. The concept of layering is widespread in complex systems, but has not been considered conceptually. Noting that graphs are a key formalism in the description of complex systems, we establish a notion of a layered graph. We provide a logical characterization of this notion of layering using a non-associative, non-commutative substructural, separating logic. We provide soundness and completeness results for a class of algebraic models that includes layered graphs, which give a mathematically substantial semantics to this very weak logic. We explain, via examples, applications in information processing and security.
Original languageEnglish
Pages (from-to)953-988
Number of pages36
JournalJournal of Logic and Computation
Volume24
Issue number4
Early online date18 Feb 2014
DOIs
Publication statusPublished - Aug 2014

    Fingerprint

Keywords

  • substructural logic
  • semantics
  • proof theory
  • graphs
  • layers
  • complex systems
  • modelling

Cite this