کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4662034 1633506 2010 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Games with 1-backtracking
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات منطق ریاضی
پیش نمایش صفحه اول مقاله
Games with 1-backtracking
چکیده انگلیسی

We associate with any game G another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for G: if a player has a winning strategy of recursive degree 1 over G, 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) [6], , Hayashi and Nakata (2001) [7]).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Annals of Pure and Applied Logic - Volume 161, Issue 10, July 2010, Pages 1254-1269