Corrected upper bounds for free-cut elimination (Q719283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cut-elimination and redundancy-elimination by resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conservation Result Concerning Bounded Theories and the Collection Axiom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of quantifier alternations in cut elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut Elimination in the Presence of Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound on the lengthening of proofs by cut elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>n</i>-quantifier induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut elimination and automatic proof procedures / rank
 
Normal rank

Latest revision as of 11:48, 4 July 2024

scientific article
Language Label Description Also known as
English
Corrected upper bounds for free-cut elimination
scientific article

    Statements

    Corrected upper bounds for free-cut elimination (English)
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    cut elimination
    0 references
    sequent calculus
    0 references
    upper bounds
    0 references
    free cut
    0 references

    Identifiers