Counting proofs in propositional logic

Simple item page
dc.creatorDavid, René
dc.creatorZaionc, Marek
dc.date2009-05-18
dc.date.accessioned2026-07-07T13:16:01Z
dc.date.available2026-07-07T13:16:01Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0905.2880
dc.identifierhttp://arxiv.org/abs/0905.2880
dc.identifierArchive for Mathematical Logic 48 (2009) P 185-199
dc.identifierdoi:10.1007/s00153-009-0119-5
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230658
dc.subjectLogic
dc.subjectLogic in Computer Science
dc.titleCounting proofs in propositional logic
dc.typetext

Files

Collections

arXiv