Counting proofs in propositional logic

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Logic, Logic in Computer Science

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/230658

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.2880
 http://arxiv.org/abs/0905.2880
 Archive for Mathematical Logic 48 (2009) P 185-199
 doi:10.1007/s00153-009-0119-5

Collections

arXiv