Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q306823 |
Changed an Item |
||
Property / author | |||
Property / author: Pavel Naumov / rank | |||
Normal rank |
Revision as of 18:28, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds on complexity of Frege proofs with limited use of certain schemata |
scientific article |
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