Jump to content

Lightface analytic game

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Awkwafaba (talk | contribs) at 02:06, 14 October 2023 (script-assisted date audit and style fixes per MOS:NUM). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In descriptive set theory, a lightface analytic game is a game whose payoff set A is a subset of Baire space; that is, there is a tree T on which is a computable subset of , such that A is the projection of the set of all branches of T.

The determinacy of all lightface analytic games is equivalent to the existence of 0#.