Revision as of 01:36, 23 November 2013 edit Blaisorblade (talk \| contribs) Extended confirmed users 1,140 edits m →Technical Definition: Fix typo and bibliographic reference ← Previous edit		Revision as of 09:19, 4 April 2014 edit undo 140.77.14.84 (talk) No edit summary Next edit →
Line 1: '''Bar recursion''' is a generalized form of recursion developed by C. Spector in his 1962 paper.<ref>{{cite book\|author=C. Spector\|chapter=Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics\|editor=F. D. E. Dekker\|title=Recursive Function Theory: Proc. ~~Symoposia~~Symposia in Pure Mathematics\|volume=5\|pages=1–27\|year=1962\|publisher=[[American Mathematical Society]]}}</ref> It is related to [[bar induction]] in the same fashion that [[primitive recursion]] is related to ordinary [[Mathematical induction\|induction]], or [[transfinite recursion]] is related to [[transfinite induction]]. ==Technical Definition==

Bar recursion: Difference between revisions