Order:
  1.  29
    The slow-growing and the grzecorczyk hierarchies.E. A. Cichon & S. S. Wainer - 1983 - Journal of Symbolic Logic 48 (2):399-408.
  2.  39
    Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
    The termination of rewrite systems for parameter recursion, simple nested recursion and unnested multiple recursion is shown by using monotone interpretations both on the ordinals below the first primitive recursively closed ordinal and on the natural numbers. We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of the facts that the schemata of parameter recursion, simple nested recursion and unnested multiple recursion lead from primitive recursive functions to primitive recursive functions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  3. Hjorth, G., see Hauser, K.A. Andretta, J. Steel, J. Blanck, A. Carbone, E. A. Cichon & A. Weiermann - 1997 - Annals of Pure and Applied Logic 83:301.
     
    Export citation  
     
    Bookmark  
  4.  13
    (1 other version)Strictly orthogonal left linear rewrite systems and primitive recursion.E. A. Cichon & E. Tahhan-Bittar - 2001 - Annals of Pure and Applied Logic 108 (1-3):79-101.
    Let F be a signature and R a strictly orthogonal rewrite system on ground terms of F . We give an effective proof of a bounding condition for R , based on a detailed analysis of how terms are transformed during the rewrite process, which allows us to give recursive bounds on the derivation lengths of terms. We give a syntactic characterisation of the Grzegorczyk hierarchy and a rewriting schema for calculating its functions. As a consequence of this, using results (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark