The hierarchy of terminating recursive programs over N

DOI10.1007/3-540-60178-3_90MaRDI QIDQ6064287zbMATH OpenOpenAlexFDO

Authors 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

• A Uniform Approach to Fundamental Sequences and Hierarchies
• Bounding derivation lengths with functions from the slow growing hierarchy
• Equational derivation vs. computation
• Extension of an effectively generated class of functions by enumeration
• scientific article; zbMATH DE number 432704 (Why is no real title available?)
• scientific article; zbMATH DE number 408817 (Why is no real title available?)
• scientific article; zbMATH DE number 806754 (Why is no real title available?)
• Nested recursion
• Ordinal complexity of recursive definitions
• Slow growing versus fast growing
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064287)