Counting proofs in propositional logic
arXiv:0905.2880 · doi:10.1007/s00153-009-0119-5
Abstract
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.