Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079)

From MaRDI portal
Revision as of 14:37, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    axiomatization of classical propositional logic
    0 references
    proof complexity
    0 references
    0 references
    0 references