Non-definability of the Ackermann function with type 1 partial primitive recursion

DOI10.1007/s001530050077zbMath0894.03021OpenAlexW1967612355MaRDI QIDQ1816488

Karl-Heinz Niggl

Publication date: 15 December 1996

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

Full work available at URL: https://doi.org/10.1007/s001530050077

zbMATH Keywords

Ackermann functioncontinuous functionalspartial primitive recursive functionalsimply typed term systemGödel recursorssubrecursiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: Non-definability of the Ackermann function with type 1 partial primitive recursion