Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00153-005-0325-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999043370 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 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
