Hierarchies of Primitive Recursive Functions

DOI10.1002/malq.19680142106zbMath0172.29703OpenAlexW2102557830MaRDI QIDQ5560277

Charles Parsons

Publication date: 1968

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19680142106

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (12)

Existence of superposition bases in countable primitively recursively closed classes ⋮ Induction rules, reflection principles, and provably recursive functions ⋮ Elementary realizability ⋮ Operation of bound prefix concatenation and finite superposition bases ⋮ Complexity of algorithms and computations ⋮ A superposition basis in the class of Kalmar elementary functions ⋮ Bounded prefix concatenation operation and finite bases with respect to the superposition ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ Increase of the complexity of functions by an application of multiple recursion ⋮ Separating NC along the \(\delta\) axis ⋮ On the computational complexity of imperative programming languages ⋮ Relativization of the Theory of Computational Complexity

This page was built for publication: Hierarchies of Primitive Recursive Functions