Logic in Computer Science, Symposium on
Download PDF

Abstract

We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra consists of a Boolean algebra with operators modeling probabilistic transitions. We prove a Stone-type duality between countable Aumann algebras and countably-generated continuous-space Markov processes. Our results subsume existing results on completeness of probabilistic modal logics for Markov processes.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles