Selection functions, bar recursion and backward induction

DOI10.1017/S0960129509990351zbMATH Open1207.03072OpenAlexW2048835253MaRDI QIDQ3559969FDOQ3559969

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

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

zbMATH Keywords

equilibriamonadbackward inductionbar recursionfinite gamessequential gamescontinuous countably infinite games

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• The equivalence of bar recursion and open recursion
• The Peirce translation
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Higher-order games with dependent types
• Bar recursion and products of selection functions
• A coalgebraic view of bar recursion and bar induction
• Smart Choices and the Selection Monad
• Title not available (Why is that?)
• Constructive forcing, CPS translations and witness extraction in interactive realizability
• Title not available (Why is that?)
• On Spector's bar recursion
• Sequential games and optimal strategies
• Programming with algebraic effects and handlers
• A generalization of Nash's theorem with higher-order functionals
• Well quasi-orders and the functional interpretation
• The Herbrand functional interpretation of the double negation shift
• Algorithm design with the selection monad
• A constructive interpretation of Ramsey's theorem via the product of selection functions
• Bar recursion is not computable via iteration
• A note on the finitization of Abelian and Tauberian theorems

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)