Recursive Functionals and Quantifiers of Finite Types II

DOI10.2307/1993829zbMath0121.01302OpenAlexW4229526405MaRDI QIDQ5731778

Stephen C. Kleene

Publication date: 1963

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1993829

zbMATH Keywords

mathematical logic

Related Items (24)

Mathematics, Metaphysics and the Multiverse ⋮ The limits of E-recursive enumerability ⋮ Effective topological spaces. III: Forcing and definability ⋮ Inadmissible forcing ⋮ Generalized computations with oracles ⋮ Hyperanalytic Predicates ⋮ Rethinking revision ⋮ Countable admissible ordinals and hyperdegrees ⋮ Discrete Transfinite Computation ⋮ Syntax and Semantics in Higher-Type Recursion Theory ⋮ Inductively defined sets of reals ⋮ A logical framework for large file information handling ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ Applications of infinitary lambda calculus ⋮ Representability in some systems of second order arithmetic ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ A game-semantic model of computation ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ Effective topological spaces. I: A definability theory ⋮ The theory of recursive functions, approaching its centennial ⋮ Reflection and forcing in E-recursion theory ⋮ Constructive transfinite number classes ⋮ Effective topological spaces. II: A hierarchy

This page was built for publication: Recursive Functionals and Quantifiers of Finite Types II