Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

PREDICTABLY COMPUTABLE FUNCTIONALS AND DEFINITION BY RECURSION

From MaRDI portal
Publication:5339294
Jump to:navigation, search

DOI10.1002/malq.19640100502zbMath0131.00703OpenAlexW1963892707MaRDI QIDQ5339294

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



Related Items (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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5339294&oldid=20033671"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 23:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki