Ockham's razor and reasoning about information flow
Logic
2008-08-12 v1 Logic in Computer Science
Abstract
What is the minimal algebraic structure to reason about information flow? Do we really need the full power of Boolean algebras with co-closure and de Morgan dual operators? How much can we weaken and still be able to reason about multi-agent scenarios in a tidy compositional way? This paper provides some answers.
Cite
@article{arxiv.0808.1354,
title = {Ockham's razor and reasoning about information flow},
author = {Mehrnoosh Sadrzadeh},
journal= {arXiv preprint arXiv:0808.1354},
year = {2008}
}
Comments
15 pages