PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION

DOI10.1002/MALQ.19640100502MaRDI QIDQ5339294zbMATH OpenOpenAlexFDO

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

(2)

• Lower bounds on the worst-case complexity of some oracle algorithms
• The complexity of theorem-proving procedures

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)