Counting proofs in propositional logic

Archive for Mathematical Logic

Volumn 48, Issue 2, 2009, Pages 185-199

  David, René ^a   Zaionc, Marek ^b  

^a UNIVERSITÉ DE SAVOIE   (France)

^b JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 62949092685     PISSN: 09335846     EISSN: 14320665     Source Type: Journal    
DOI: 10.1007/s00153-009-0119-5     Document Type: Article

References (8)

1. Ben-Yelles, C.B.: Type Assignment in the Lambda Calculus. Syntax and Semantics. Thesis, Mathematics Department, University of Wales Swansea, Swansea, UK (1979)
2. de Groote, P.: Strong Normalization of Classical Natural Deduction with Disjunction. Lecture Notes in Computer Science, vol. 2044, pp. 182-196. Springer, Berlin (2001)
3. Hindley, J.R.: Basic Simple Type Theory. Cambridge Tracts in Theoretical Computer Science, vol. 42. Cambridge University Press, Cambridge (1997)
4. S. Hirokawa 1998 Infiniteness of proof(α) is P-space complete Theor. Comput. Sci. 206 1-2 331 339
5. Parigot, M.: λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. Lecture Notes in Computer Science, vol. 624, pp. 190-201. Springer, Berlin (1992)
6. Troelstra A.S., Schwichtenberg H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)
7. Van Dalen D.: Logic and Structure. Springer, Berlin (1997)
8. Wells, J.B., Yakobowski, B.: Graph Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis. Lecture Notes in Computer Science, vol. 3573, pp. 262-277. Springer, Berlin (2005)