PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION

DOI10.1002/MALQ.19640100502zbMATH Open0131.00703OpenAlexW1963892707MaRDI QIDQ5339294FDOQ5339294

Authors: Donald L. Kreider, R. W. Ritchie 

Publication date: 1964

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

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

zbMATH Keywords

mathematical logic

Cited In (1)

• Lower bounds on the worst-case complexity of some oracle algorithms

This page was built for publication: PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION

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