The hierarchy of terminating recursive programs over N

DOI10.1007/3-540-60178-3_90OpenAlexW2137894850MaRDI QIDQ6064287

Stanley S. Wainer

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_90

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
• Nested recursion
• Ordinal complexity of recursive definitions
• Bounding derivation lengths with functions from the slow growing hierarchy
• Equational derivation vs. computation
• Extension of an effectively generated class of functions by enumeration
• Slow growing versus fast growing
• A Uniform Approach to Fundamental Sequences and Hierarchies

This page was built for publication: The hierarchy of terminating recursive programs over N