Ockham's razor and reasoning about information flow

2008/08/09 by Mehrnoosh Sadrzadeh, Sadrzadeh, Mehrnoosh
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #cs.LO #math.LO

paper · pdf · doi:10.48550/arxiv.0808.1354

15 pages

arxiv created 2008/08/09 · arxiv updated 2009/12/01

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.

Related

• An Algebraic Approach for Reasoning About Information Flow
• The Category-Theoretic Arithmetic of Information
• Inputs, Outputs, and Composition in the Logic of Information Flows
• Algebras of Information. An Axiomatic Foundation
• A General Theory of Information and Computation