{
  "id": "0905.2880",
  "version": "v1",
  "published": "2009-05-18T13:14:01.000Z",
  "updated": "2009-05-18T13:14:01.000Z",
  "title": "Counting proofs in propositional logic",
  "authors": [
    "René David",
    "Marek Zaionc"
  ],
  "journal": "Archive for Mathematical Logic 48 (2009) P 185-199",
  "doi": "10.1007/s00153-009-0119-5",
  "categories": [
    "math.LO",
    "cs.LO"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-05-18T13:14:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "propositional logic",
      "counting proofs"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0905.2880D"
    }
  }
}