Ockham's razor and reasoning about information flow

Simple item page
dc.creatorSadrzadeh, Mehrnoosh
dc.date2008-08-09
dc.date.accessioned2026-07-07T09:55:52Z
dc.date.available2026-07-07T09:55:52Z
dc.descriptionWhat 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.
dc.description15 pages
dc.identifierhttps://arxiv.org/abs/0808.1354
dc.identifierhttp://arxiv.org/abs/0808.1354
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166784
dc.subjectLogic
dc.subjectLogic in Computer Science
dc.titleOckham's razor and reasoning about information flow
dc.typetext

Files

Collections

arXiv