Selection functions, bar recursion and backward induction

DOI10.1017/S0960129509990351MaRDI QIDQ3559969zbMATH OpenOpenAlexFDO

Authors Martín Escardo, Paulo Oliva

Publication date 17 May 2010

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129509990351

zbMATH Keywords

backward inductionbar recursioncontinuous countably infinite gamesequilibriafinite gamesmonadsequential games

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Metamathematics of constructive systems (03F50) Categorical logic, topoi (03G30) Applications of game theory (91A80)

Recommendations

• On Spector's bar recursion
• Sequential games and optimal strategies
• Bar recursion and products of selection functions
• A coalgebraic view of bar recursion and bar induction
• Bar recursion over finite partial functions

Cites work

• A convenient category of domains
• A Relationship between Equilogical Spaces and Type Two Effectivity
• Algorithmic Game Theory
• Compactly generated domain theory
• Comparing Cartesian closed categories of (core) compactly generated spaces
• Effectively given domains
• Extended admissibility.
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• scientific article; zbMATH DE number 3231083 (Why is no real title available?)
• Modified bar recursion
• Monads on symmetric monoidal closed categories
• Notions of computation and monads
• On Double Dualization Monads.
• On the computational content of the axiom of choice
• Strong functors and monoidal monads
• Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals

Cited in

(26)

• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• A coalgebraic view of bar recursion and bar induction
• A generalization of Nash's theorem with higher-order functionals
• On Spector's bar recursion
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Sequential games and optimal strategies
• Well quasi-orders and the functional interpretation
• Backward induction for repeated games
• The equivalence of bar recursion and open recursion
• The Peirce translation
• Programming with algebraic effects and handlers
• The Herbrand functional interpretation of the double negation shift
• scientific article; zbMATH DE number 7297814 (Why is no real title available?)
• Bar recursion is not computable via iteration
• Bar recursion and products of selection functions
• Constructive forcing, CPS translations and witness extraction in interactive realizability
• A constructive interpretation of Ramsey's theorem via the product of selection functions
• Higher-order games with dependent types
• A note on the finitization of Abelian and Tauberian theorems
• Algorithm design with the selection monad
• Smart Choices and the Selection Monad
• What monads can and cannot do with a bit of extra time
• What monads can and cannot do with a few extra pages
• Computing Nash equilibria of unbounded games
• Uniform functional interpretations
• Natural constructive proofs of A via A B, proof paradoxes, and impredicativity

This page was built for publication: Selection functions, bar recursion and backward induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559969)