Term rewriting theory for the primitive recursive functions
type: Item
instance of: scholarly article
title: Term rewriting theory for the primitive recursive functions
zbMATH Open document ID: 0871.03033
DOI: 10.1016/S0168-0072(96)00015-2
author: E. A. Cichon
author: Andreas Weiermann
published in: Annals of Pure and Applied Logic
publication date: 1997-09-29T00:00:00Z
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 986678
zbMATH Keywords: rewriting systems
zbMATH Keywords: termination
zbMATH Keywords: parameter recursion
zbMATH Keywords: simple nested recursion
zbMATH Keywords: unnested multiple recursion
zbMATH Keywords: derivation lengths
zbMATH Keywords: primitive recursive functions
MaRDI profile type: Publication
cites work: Q3138831
cites work: The slow-growing and the Graegorczyk hierarchies
cites work: Q3138832
cites work: Computability. Recursive and programmable functions
cites work: Π12-logic, Part 1: Dilators
cites work: Q5629622
cites work: Equational derivation vs. computation
cites work: Termination proofs by multiset path orderings imply primitive recursive derivation lengths
cites work: Q5600870
cites work: Q5533181
cites work: Q3325707
cites work: Q3960847
cites work: Q4133625
cites work: Q4143279
cites work: Herbrand analyses
cites work: The realm of primitive recursion
cites work: Slow growing versus fast growing
cites work: Bounding derivation lengths with functions from the slow growing hierarchy
cites work: Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
cites work: Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
cites work: A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
full work available at URL: s0168-0072(96)00015-2
OpenAlex ID: W1996792588
description: scientific article; zbMATH DE number 986678