Live briefing
Everything about Bar recursion
Generalized form of recursion
Bar recursion is a generalized form of recursion developed by C. Spector in his 1962 paper. 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bar recursionA 5-minute orientation
- Pick up a classic book: C How to ProgramThe most-reprinted book on the subject
- Read the landmark paper: Selection functions, bar recursion and backward inductionCited 43 times
- Go sideways: Dialectica interpretationA closely related topic
- Go sideways: Fixed-point combinatorA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Selection functions, bar recursion and backward induction
Modified bar recursion
The equivalence of bar recursion and open recursion
BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS
On bar recursion of types 0 and 1
On Spector's bar recursion
Ordinal analysis of simple cases of bar recursion
Equivalence of bar induction and bar recursion for continuous functions with continuous moduli
📚 Books worth reading
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
The primacy of grammarNirmalangshu Mukherji · 2010- 📕The recursivity of lawBruce G. Carruthers · 1994
- 📕The primacy of grammarNirmalangshu Mukherji · 2010
Java Methods A&AB, AP EditionGary Litvin, Maria Litvin · 2006
The Human Planet · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Dialectica interpretation In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive…
- Fixed-point combinator In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function (i.e., a function that takes a…
- Transfinite induction Transfinite induction is an extension of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the…
- Recursive definition In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements…
- System F System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus…
- Reverse mathematics Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining…
- Well-founded relation In mathematics, a binary relation R is called well-founded (or wellfounded or foundational) on a set or, more generally, a class X if every non-empty subset…
- Ackermann function In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable…