Bar recursion
Bar recursion is a generalized form of recursion developed by Spector in his 1962 paper [1]. It is related to bar induction in the same fashion that primitive recursion is related to ordinary induction, or transfinite recursion is related to transfinite induction.
Technical Definition
References
- ^ C. Spector (1962). "Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics". In F. D. E. Dekker (ed.). Recursive Function Theory: Proc. Symoposia in Pure Mathematics. Vol. 5. American Mathematical Society. pp. 1–27.
- ^ "Selection functions, Bar recursion, and Backwards Induction" (PDF). Math. Struct. in Comp.Science.
{{cite journal}}: Unknown parameter|authors=ignored (help)