Lightface analytic game: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>Awkwafaba
m script-assisted date audit and style fixes per MOS:NUM
 
(No difference)

Latest revision as of 03:06, 14 October 2023

Template:Use dmy dates Template:Short description Template:Unreferenced

In descriptive set theory, a lightface analytic game is a game whose payoff set A is a Σ11 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#.


Template:Mathlogic-stub