Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the computational content of intuitionistic propositional proofs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3235339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of cutting-plane proofs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank | |||
Normal rank |
Latest revision as of 14:37, 24 June 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