Term rewriting theory for the primitive recursive functions (Q674412): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3138831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The slow-growing and the Graegorczyk hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability. Recursive and programmable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Π12-logic, Part 1: Dilators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational derivation vs. computation / 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: Q5600870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrand analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realm of primitive recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slow growing versus fast growing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding derivation lengths with functions from the slow growing hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones / 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: A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity / rank
 
Normal rank

Revision as of 10:35, 27 May 2024

scientific article
Language Label Description Also known as
English
Term rewriting theory for the primitive recursive functions
scientific article

    Statements

    Term rewriting theory for the primitive recursive functions (English)
    0 references
    0 references
    0 references
    29 September 1997
    0 references
    rewriting systems
    0 references
    termination
    0 references
    parameter recursion
    0 references
    simple nested recursion
    0 references
    unnested multiple recursion
    0 references
    derivation lengths
    0 references
    primitive recursive functions
    0 references

    Identifiers