Counting proofs in propositional logic (Q1014285)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting proofs in propositional logic |
scientific article; zbMATH DE number 5547510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting proofs in propositional logic |
scientific article; zbMATH DE number 5547510 |
Statements
Counting proofs in propositional logic (English)
0 references
27 April 2009
0 references
The authors give a procedure for counting the number of different normal proofs of a formula in propositional logic. They show that this number, either an integer or infinite, is the least fix-point of a system of polynomial equations in some natural complete lattice. An algorithm for finding such a least fix-point is described as well.
0 references
propositional logic
0 references
number of normal proofs
0 references
0.7362076640129089
0 references
0.7242349982261658
0 references
