Author:
ESCARDÓ MARTÍN,OLIVA PAULO
Abstract
AbstractThis paper considers a generalisation of selection functions over an arbitrary strong monad T, as functionals of type $J_R^T X = (X \to R) \to TX$. It is assumed throughout that R is a T-algebra. We show that $J_R^T$ is also a strong monad, and that it embeds into the continuation monad $K_R X = (X \to R) \to R$. We use this to derive that the explicitly controlled product of T-selection functions is definable from the explicitly controlled product of quantifiers, and hence from Spector’s bar recursion. We then prove several properties of this product in the special case when T is the finite powerset monad ${\cal P}_{\rm{f}} \left( \cdot \right)$. These are used to show that when $TX = {\cal P}_{\rm{f}} \left( X \right)$ the explicitly controlled product of T-selection functions calculates a witness to the Herbrand functional interpretation of the double negation shift.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. On a generalization of quantifiers;Mostowski;Fundamenta Mathematicae,1957
2. Nonstandardness and the bounded functional interpretation
3. [8] Ferreira F. and Engrácia P. , The bounded functional interpretation of the double negation shift, this Journal, vol. 75 (2010), no. 2, pp. 759–773.
4. Sequential games and optimal strategies
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Higher-order games with dependent types;Theoretical Computer Science;2023-09
2. Smart Choices and the Selection Monad;Logical Methods in Computer Science;2023-04-20
3. Monadic Systems;IFAC-PapersOnLine;2022
4. Smart Choices and the Selection Monad;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
5. Backward Induction for Repeated Games;Electronic Proceedings in Theoretical Computer Science;2018-07-10