1. Games with 1-backtracking
- Author
-
Berardi, Stefano, Coquand, Thierry, and Hayashi, Susumu
- Subjects
- *
GAME theory , *TOPOLOGICAL degree , *ALGORITHMS , *NUMERICAL calculations , *RECURSIVE functions , *PROOF theory - Abstract
Abstract: We associate with any game another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for : if a player has a winning strategy of recursive degree over , then it has a recursive winning strategy over , and vice versa. Through we can express in algorithmic form, as a recursive winning strategy, many (but not all) common proofs of non-constructive Mathematics, namely exactly the theorems of the sub-classical logic Limit Computable Mathematics (Hayashi (2006) , Hayashi and Nakata (2001) ). [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF