Theory of Provable Recursive Functions
From MaRDI portal
Publication:5338326
DOI10.2307/1994221zbMath0129.26001OpenAlexW4250345862MaRDI QIDQ5338326
Publication date: 1965
Full work available at URL: https://doi.org/10.2307/1994221
Related Items
Complexity classes of provable recursive functions, Independence results in computer science?, Relations between diagonalization, proof systems, and complexity gaps, On “provable” analogs of and, A note on inverses of elementary permutations