Counting proofs in propositional logic
From MaRDI portal
Publication:1014285
DOI10.1007/S00153-009-0119-5zbMATH Open1168.03005arXiv0905.2880OpenAlexW2107956612MaRDI QIDQ1014285FDOQ1014285
Authors: René David, Marek Zaionc 
Publication date: 27 April 2009
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0905.2880
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer science logic. 10th international workshop, CSL '96. Annual conference of the EACSL, Utrecht, the Netherlands. September 21--27, 1996. Selected papers
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
Cited In (11)
- Propositional proof skeletons
- On the number of steps in proofs
- Title not available (Why is that?)
- Proofs of the compactness theorem
- Unsolvable systems of equations and proof complexity
- A logical characterization of the counting hierarchy
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search
- Enumerating lambda terms by weighted length of their de Bruijn representation
- On the number of unary-binary tree-like structures with restrictions on the unary height
- A coinductive approach to proof search through typed lambda-calculi
- Proofs that count
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)
