Enumeration and the Grzegorczyk Hierarchy
From MaRDI portal
Publication:3851086
DOI10.1002/malq.19630090106zbMath0112.24602OpenAlexW2027433771MaRDI QIDQ3851086
Publication date: 1963
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19630090106
Related Items (8)
Hierarchies of Computable groups and the word problem ⋮ THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY ⋮ Strictly primitive recursive realizability, I ⋮ A New Hierarchy of Elementary Functions ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability ⋮ Complexity of algorithms and computations ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
This page was built for publication: Enumeration and the Grzegorczyk Hierarchy
