Counting proofs in propositional logic
Logic
2009-05-19 v1 Logic in Computer Science
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.
Cite
@article{arxiv.0905.2880,
title = {Counting proofs in propositional logic},
author = {René David and Marek Zaionc},
journal= {arXiv preprint arXiv:0905.2880},
year = {2009}
}