Counting proofs in propositional logic
classification
🧮 math.LO
cs.LO
keywords
countingformulalogicnumberproofspropositionaldifferenteither
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.