arXiv Analytics

Sign in

arXiv:0905.2880 [math.LO]AbstractReferencesReviewsResources

Counting proofs in propositional logic

René David, Marek Zaionc

Published 2009-05-18Version 1

We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.

Journal: Archive for Mathematical Logic 48 (2009) P 185-199
Categories: math.LO, cs.LO
Related articles: Most relevant | Search more
arXiv:1412.7998 [math.LO] (Published 2014-12-26)
Propositional Logics of Dependence and Independence, Part I
arXiv:2303.14022 [math.LO] (Published 2023-03-24)
The propositional logic of teams
arXiv:math/0308177 [math.LO] (Published 2003-08-19, updated 2004-06-01)
Generic substitutions

Links

Toolbox