Ockham's razor and reasoning about information flow
classification
🧮 math.LO
cs.LO
keywords
flowinformationreasonablealgebraicalgebrasanswersboolean
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.