Selection functions, bar recursion and backward induction

DOI10.1017/S0960129509990351zbMath1207.03072OpenAlexW2048835253MaRDI QIDQ3559969

Martín Hötzel Escardó, 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

equilibriabackward inductionmonadbar recursionfinite gamessequential gamescontinuous countably infinite games

Mathematics Subject Classification ID

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

Related Items (20)

On Spector's bar recursion ⋮ The equivalence of bar recursion and open recursion ⋮ Higher-order games with dependent types ⋮ The Peirce translation ⋮ A note on the finitization of Abelian and Tauberian theorems ⋮ Algorithm design with the selection monad ⋮ Smart Choices and the Selection Monad ⋮ Constructive forcing, CPS translations and witness extraction in Interactive realizability ⋮ Unnamed Item ⋮ Programming with algebraic effects and handlers ⋮ Well Quasi-orders and the Functional Interpretation ⋮ 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 ⋮ A constructive interpretation of Ramsey's theorem via the product of selection functions ⋮ Bar recursion is not computable via iteration ⋮ A Coalgebraic View of Bar Recursion and Bar Induction ⋮ THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT ⋮ A generalization of Nash's theorem with higher-order functionals ⋮ Sequential games and optimal strategies ⋮ BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS

Cites Work

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

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