Some Remarks on Counting Propositional Logic

Overview & Synopsis

Counting propositional logic was recently introduced in relation to randomized computation and shown able to logically characterize the full counting hierarchy [1]. In this paper we aim to clarify the intuitive meaning and expressive power of its univariate fragment. On the one hand, we make the connection between this logic and stochastic experiments explicit, proving that the counting language can simulate any (and only) event associated with dyadic distributions. On the other, we provide an effective procedure to measure the probability of counting formulas.