Sprague-Grundy theory in bounded arithmetic
Logic
2016-09-09 v1
Abstract
In this paper, we formalize Sprague-Grundy theory for combinatorial games in bounded arithmetic. We show that in the presence of Sprague-Grundy numbers, a fairly weak axioms capture PSPACE.
Keywords
Cite
@article{arxiv.1609.02408,
title = {Sprague-Grundy theory in bounded arithmetic},
author = {Satoru Kuroda},
journal= {arXiv preprint arXiv:1609.02408},
year = {2016}
}