Counting proofs in propositional logic
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2009
- DOI:
- 10.48550/arXiv.0905.2880
- arXiv:
- arXiv:0905.2880
- Bibcode:
- 2009arXiv0905.2880D
- Keywords:
-
- Mathematics - Logic;
- Computer Science - Logic in Computer Science
- E-Print:
- Archive for Mathematical Logic 48 (2009) P 185-199