Recursive Functionals and Quantifiers of Finite Types Revisited, V

DOI10.2307/2001641zbMATH Open0748.03030OpenAlexW4253946311MaRDI QIDQ3978437FDOQ3978437

Authors: Stephen Cole Kleene 

Publication date: 25 June 1992

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

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

Recommendations

• scientific article; zbMATH DE number 3912368
• scientific article; zbMATH DE number 3983152
• Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal
• The hereditary partial effective functionals and recursion theory in higher types
• Axiomatic recursion theory and the continuous functionals

zbMATH Keywords

computationcomputable functionalsoracleshigher type recursion theoryrecursion in higher type functionals

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Cited In (14)

• A game-semantic model of computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal
• Title not available (Why is that?)
• Closed machine-oracle model of the arithmetic of transfinite types
• Title not available (Why is that?)
• Recursion on generalized computable ordinals
• Title not available (Why is that?)
• Recursive functionals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursion in Kolmogorov's R-operator and the ordinal σ₃
• The hereditary partial effective functionals and recursion theory in higher types

This page was built for publication: Recursive Functionals and Quantifiers of Finite Types Revisited, V

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978437)