On Counting Propositional Logic
Logic in Computer Science
2021-06-04 v2 Computational Complexity
Programming Languages
Abstract
We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy, but also that the resulting logic admits a satisfactory proof-theoretical treatment. From the latter, a type system for a probabilistic lambda-calculus is derived in the spirit of the Curry-Howard correspondence, showing the potential of counting propositional logic as a useful tool in several fields of theoretical computer science.
Cite
@article{arxiv.2103.12862,
title = {On Counting Propositional Logic},
author = {Melissa Antonelli and Ugo Dal Lago and Paolo Pistone},
journal= {arXiv preprint arXiv:2103.12862},
year = {2021}
}