Equational derivation vs. computation

DOI10.1016/0168-0072(94)90068-XzbMath0811.03032OpenAlexW2022895169WikidataQ126407810 ScholiaQ126407810MaRDI QIDQ1338198

W. G. Handley, Stanley S. Wainer

Publication date: 27 November 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)90068-x

zbMATH Keywords

ordinal analysiscomplexity measuresrecursive functionsfast growing hierarchyslow growing hierarchysubrecursive hierarchiescomputations by term-rewritingKleene's equation calculus

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, The hierarchy of terminating recursive programs over N, Term rewriting theory for the primitive recursive functions

Cites Work

• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Slow growing versus fast growing
• The slow-growing and the Graegorczyk hierarchies
• Natural well-orderings
• Π12-logic, Part 1: Dilators
• An Approach to a Unified Theory of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item