Counting proofs in propositional logic

Archive for Mathematical Logic 48 (2):185-199 (2009)
  Copy   BIBTEX


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



    Upload a copy of this work     Papers currently archived: 74,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Three Dimensions of Proofs.Yves Guiraud - 2006 - Annals of Pure and Applied Logic 141 (1):266-295.
Some Remarks on Lengths of Propositional Proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - Journal of Symbolic Logic 72 (2):439 - 451.
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The Number of Lines in Frege Proofs with Substitution.Alasdair Urquhart - 1997 - Archive for Mathematical Logic 37 (1):15-19.
Isomorphic Formulae in Classical Propositional Logic.Kosta Došen & Zoran Petrić - 2012 - Mathematical Logic Quarterly 58 (1):5-17.


Added to PP

65 (#181,558)

6 months
1 (#415,900)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Basic Proof Theory.A. S. Troelstra - 2000 - Cambridge University Press.
Logic and Structure.D. van Dalen - 1980 - Springer Verlag.

Add more references