Selection functions, bar recursion and backward induction

doi:10.1017/s0960129509990351

Selection functions, bar recursion and backward induction

2010-03-25

0

OA

AI

DOI：10.1017/s0960129509990351

原文链接

查看原文

摘要

En 中文

Bar recursion arises in constructive mathematics, logic, proof theory and higher-type computability theory. We explain bar recursion in terms of sequential games, and show how it can be naturally understood as a generalisation of the principle of backward induction that arises in game theory. In summary, bar recursion calculates optimal plays and optimal strategies, which, for particular games of interest, amount to equilibria. We consider finite games and continuous countably infinite games, and relate the two. The above development is followed by a conceptual explanation of how the finite version of the main form of bar recursion considered here arises from a strong monad of selections functions that can be defined in any cartesian closed category. Finite bar recursion turns out to be a well-known morphism available in any strong monad, specialised to the selection monad.

Selection functions, bar recursion and backward induction

摘要

AI总结

期刊

机构

引用论文