An answer to an open problem of Urquhart (Q1129262): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On different structure-preserving translations to normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Gentzen systems for propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank

Revision as of 14:48, 28 May 2024

scientific article
Language Label Description Also known as
English
An answer to an open problem of Urquhart
scientific article

    Statements

    An answer to an open problem of Urquhart (English)
    0 references
    0 references
    13 August 1998
    0 references
    proof complexity
    0 references
    polynomial simulation
    0 references
    sequent calculus
    0 references
    propositional logic
    0 references
    resolution with limited extension
    0 references
    Gentzen calculus
    0 references
    analytic cut rule
    0 references

    Identifiers