scientific article; zbMATH DE number 3983152

MaRDI QIDQ3748274zbMATH OpenFDO

Authors Stephen Cole Kleene

Publication date 1985

zbMATH Keywords

algorithmcomputationrecursivenessrecursion theoremoraclefunctionals of finite typesubstitution theoremhigher type recursionunimonotonicity

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Recommendations

• Recursive Functionals and Quantifiers of Finite Types Revisited, V
• scientific article; zbMATH DE number 3912368
• Partial elements and recursion via dominances in univalent type theory
• A rich hierarchy of functionals of finite types
• On uniform definability of types over finite sets
• Partial univalence in \(n\)-truncated type theory
• scientific article; zbMATH DE number 1531372
• The finite type problem for unary algebras
• Fundamental theorems of extensional untyped -calculus revisited
• Untyped Recursion Schemes and Infinite Intersection Types

Cited in

(8)

• A game-semantic model of computation
• Solvable classes of discrete dynamic programming
• The recursion hierarchy for PCF is strict
• scientific article; zbMATH DE number 1524334 (Why is no real title available?)
• scientific article; zbMATH DE number 3912368 (Why is no real title available?)
• Another approach to sequentiality: Kleene's unimonotone functions
• Fuzzy neural networks
• Regular expressions and the equivalence of programs

This page was built for publication:

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