Counting proofs in propositional logic
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1722654 (Why is no real title available?)
- scientific article; zbMATH DE number 1324438 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 949290 (Why is no real title available?)
- Computer science logic. 10th international workshop, CSL '96. Annual conference of the EACSL, Utrecht, the Netherlands. September 21--27, 1996. Selected papers
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete
Cited in
(11)- scientific article; zbMATH DE number 4041901 (Why is no real title available?)
- Propositional proof skeletons
- On the number of unary-binary tree-like structures with restrictions on the unary height
- Proofs that count
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
- A coinductive approach to proof search through typed lambda-calculi
- Unsolvable systems of equations and proof complexity
- Proofs of the compactness theorem
- A logical characterization of the counting hierarchy
- On the number of steps in proofs
- Enumerating lambda terms by weighted length of their de Bruijn representation
This page was built for publication: Counting proofs in propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014285)
