Recursively presented games and strategies

Cenzer, 1991, Polynomial-time versus recursive models, Ann. Pure Appl. Logic, 54, 17, 10.1016/0168-0072(91)90008-A Cenzer, 1992, Polynomial-time Abelian groups, Ann. Pure Appl. Logic, 56, 313, 10.1016/0168-0072(92)90076-C Cenzer, 1992, Feasible graphs and colorings, Methods of Logic in Computer Science Cenzer, 1992, Π01 classes in mathematics Gale, 1953, Infinite games with perfect information, Ann. Math. Studies, 28, 245 Garey, 1978 Jockusch, 1972, Π01-classes and degrees of theories, Trans. Am. Math. Soc., 173, 33, 10.2307/1996261 Jockusch, 1972, Degrees of members of Π01-classes, Pacific J. Math., 40, 605, 10.2140/pjm.1972.40.605 Hopcroft, 1969 Kucera, 1986, An alternative, priority free, solution to Post's problem, Lecture Notes Comput. Sci., 233, 493, 10.1007/BFb0016275 Manaster, 1972, Effective matchmaking, Proc. London Math. Soc., 25, 615, 10.1112/plms/s3-25.4.615 Metakides, 1979, Effective content of field theory, Ann. Math. Logic, 17, 289, 10.1016/0003-4843(79)90011-1 Moschovakis, 1980, Descriptive Set Theory, Vol. 100 Remmel, 1986, Graph coloring and recursively bounded Π01-classes, Ann. Pure Appl. Logic, 32, 185, 10.1016/0168-0072(86)90051-5 Rogers, 1967 von Neumann, 1947