论文信息 - Counting proofs in propositional logic - 字舞流文

Counting proofs in propositional logic

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.

René David | Marek Zaionc

[1] Joe B. Wells,et al. Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis , 2004, LOPSTR.

[2] Wil Dekkers. Reducibility of Types in Typed Lambda Calculus: Comment on a Paper by Richard Statman , 1988, Inf. Comput..

[3] Lev Gordeev,et al. Basic proof theory , 1998 .

[4] Philippe de Groote,et al. Strong Normalization of Classical Natural Deduction with Disjunction , 2001, TLCA.

[5] Michel Parigot,et al. Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction , 1992, LPAR.

[6] Dirk van Dalen,et al. Logic and structure , 1980 .

[7] Sachio Hirokawa. Infiniteness of Proof(alpha) is Polynomial-Space Complete , 1998, Theor. Comput. Sci..

[8] Nissim Francez,et al. Basic simple type theory , 1998 .