An ordinal calculus for proving termination in term rewriting (Q5878912): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3695270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal complexity of recursive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Π12-logic, Part 1: Dilators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible Independence Results for Peano Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank

Latest revision as of 14:21, 31 July 2024

scientific article; zbMATH DE number 7656677
Language Label Description Also known as
English
An ordinal calculus for proving termination in term rewriting
scientific article; zbMATH DE number 7656677

    Statements

    An ordinal calculus for proving termination in term rewriting (English)
    0 references
    0 references
    0 references
    23 February 2023
    0 references
    rewriting systems
    0 references
    termination
    0 references
    primitive recursion
    0 references
    ordinal recursion
    0 references

    Identifiers