On the Computability of the Fan Functional

DOI10.1007/978-3-319-63334-3_3zbMath1429.03151OpenAlexW2794975671MaRDI QIDQ5214781

William W. Tait, Dag Normann

Publication date: 5 February 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63334-3_3

zbMATH Keywords

fan functionalKleene computablerecursively countable

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items (1)

The non-normal abyss in Kleene's computability theory

Cites Work

• Recursion on the countable functionals
• Infinite sets that Satisfy the Principle of Omniscience in any Variety of Constructive Mathematics
• Recursive Functionals and Quantifiers of Finite Types I
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Higher-Order Computability
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Computability of the Fan Functional