论文标题
关于计算命题逻辑的一些评论
Some Remarks on Counting Propositional Logic
论文作者
论文摘要
最近引入了与随机计算有关的命题逻辑，并能够从逻辑上表征完整的计数层次结构。在本文中，我们旨在阐明其单变量片段的直观含义和表现力。一方面，我们提供了一个有效的程序来衡量计数公式的概率。另一方面，我们在明确的逻辑实验和随机实验之间建立了联系，证明计数语言可以模拟与二元分布相关的任何（也是唯一）事件。
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.
