An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Systems of reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Yves Métivier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursive bounds for Higman's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating the Knuth Bendix ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounded rewrite systems and termination proofs by generalized embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs by multiset path orderings imply primitive recursive derivation lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs and the length of derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simply terminating rewrite systems with long derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation lengths and order types of Knuth--Bendix orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calcul de longueurs de chaînes de réécriture dans le monoïde libre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction and Declarative Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5297489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for some finite forms of Kruskal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting: Interpretation and type elimination / rank
 
Normal rank

Latest revision as of 08:57, 6 June 2024

scientific article
Language Label Description Also known as
English
An upper bound on the derivational complexity of Knuth-Bendix orderings.
scientific article

    Statements

    An upper bound on the derivational complexity of Knuth-Bendix orderings. (English)
    0 references
    0 references
    19 August 2003
    0 references
    Term rewriting
    0 references
    Termination proofs
    0 references
    Knuth-Bendix order
    0 references
    Derivational complexity
    0 references

    Identifiers