Extension of an effectively generated class of functions by enumeration

DOI10.4064/cm-6-1-67-78zbMath0085.24602OpenAlexW1153502047MaRDI QIDQ3256313

Stephen C. Kleene

Publication date: 1958

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/210387

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (19)

On bimodal logics of provability ⋮ Relativization of a primitive recursive hierarchy ⋮ THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY ⋮ The hierarchy of terminating recursive programs over N ⋮ Indexings of subrecursive classes ⋮ Complexity of algorithms and computations ⋮ On a complexity-based way of constructivizing the recursive functions ⋮ Fast growing functions based on Ramsey theorems ⋮ Degrees of relative provability ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ Augmented loop languages and classes of computable functions ⋮ Polynomial and abstract subrecursive classes ⋮ Iteration of relative primitive recursion ⋮ On the structure of subrecursive degrees ⋮ On a Subrecursive Hierarchy and Primitive Recursive Degrees ⋮ Completeness of the primitive recursive \(\omega \)-rule ⋮ Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session ⋮ Classifications of Recursive Functions by Means of Hierarchies ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property

This page was built for publication: Extension of an effectively generated class of functions by enumeration