Counting proofs in propositional logic
Ren\'e David (LAMA), Marek Zaionc
TL;DR
This paper introduces a procedure to count the number of distinct proofs of a propositional logic formula, determining whether the count is finite, infinite, or zero, based on provability.
Contribution
It presents a novel method for counting proofs in propositional logic, including handling cases of non-provability and infinite proof counts.
Findings
Counts proofs as integers or infinity
Identifies whether a formula is provable or not
Provides a systematic procedure for proof enumeration
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.