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.
翻译:最近,在随机计算中引入了计价逻辑,并显示它能够逻辑地描述全部计数等级的特征。在本文中,我们的目标是澄清其单项等离子体碎片的直观含义和表达力。一方面,我们提供了一个有效的程序来测量计算公式的概率。另一方面,我们把这一逻辑和随机实验之间的联系明确化,证明计数语言可以模拟任何(而且仅)与dyadic分布相关的事件。