Counting proofs in propositional logic
Tytuł:
Counting proofs in propositional logic
Czasopismo:
Rok:
2009
Opis:
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.
Strony:
185-199
Tom (seria wydawnicza):
48
Link:
https://link.springer.com/article/10.1007/s00153-009-0119-5