Iterative Characterizations of Computable Unary Functions: A General Method

DOI10.1002/malq.19970430104zbMath0868.03018OpenAlexW2036996472MaRDI QIDQ4333464

Stefano Mazzanti

Publication date: 19 August 1997

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

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

zbMATH Keywords

computable functionsiteration operatorsfunctional closurepairing operator

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Iteration on notation and unary functions ⋮ Succinct iterative characterizations of primitive computable unary functions

This page was built for publication: Iterative Characterizations of Computable Unary Functions: A General Method