  Counting propositional logic was recently introduced in relation to
randomized computation and shown able to logically characterize the full
counting hierarchy. In this paper we aim to clarify the intuitive meaning and
expressive power of its univariate fragment. On the one hand, we provide an
effective procedure to measure the probability of counting formulas. On the
other, 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.
