Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5027254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on complexity of Frege proofs with limited use of certain schemata |
scientific article; zbMATH DE number 5027254 |
Statements
Upper bounds on complexity of Frege proofs with limited use of certain schemata (English)
0 references
26 May 2006
0 references
axiomatization of classical propositional logic
0 references
proof complexity
0 references
0.7571828961372375
0 references
0.7401764988899231
0 references
0.7401760816574097
0 references
