Depth of proofs, depth of cut-formulas and complexity of cut formulas (Q1329747): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:57, 5 March 2024

scientific article
Language Label Description Also known as
English
Depth of proofs, depth of cut-formulas and complexity of cut formulas
scientific article

    Statements

    Depth of proofs, depth of cut-formulas and complexity of cut formulas (English)
    0 references
    31 July 1994
    0 references
    The standard cut-elimination procedure for classical predicate logic is modified to make alternation of quantifiers (rather than the number of quantifiers) the main complexity parameter.
    0 references
    cut-elimination
    0 references
    alternation of quantifiers
    0 references
    complexity
    0 references
    0 references
    0 references

    Identifiers