Martin's game: a lower bound for the number of sets

  • Authors:

  • M. Ageev

  • Affiliations:

  • Pleshcheyeva st., 20-95, 127 560 Moscow, Russian Federation

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 5.23

Visualization

Abstract

We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977, p. 283) and prove that the upper bound from the above mentioned reference for the number of sets needed to construct a winning strategy, is almost tight.