Abstract
We present a method of unraveling Π 11 sets which greatly simplifies the construction in Neeman [6]. Apart from adding elegance, this method is also useful for proofs of determinacy involving long games; see Neeman [5].
Similar content being viewed by others
References
D. Gale and F. M. Stewart,Infinite games with perfect information, inContributions to the Theory of Games, Vol. 2, Annals of Mathematics Studies, no. 28, Princeton University Press, Princeton, N.J., 1953, pp. 245–266.
D. A. Martin,Borel determinacy, Annals of Mathematics (2)102 (1975), 363–371.
D. A. Martin,A purely inductive proof of Borel determinacy, inRecursion Theory (Ithaca, NY, 1982), Proceedings of Symposia in Pure Mathematics, Vol. 42, American Mathematical Society, Providence, RI, 1985, pp. 303–308.
D. A. Martin,An extension of Borel determinacy, Annals of Pure and Applied Logic49 (1990), 279–293.
I. Neeman,Determinacy for games ending at the first admissible relative to the play, to appear.
I. Neeman,Unraveling Π 11 sets, Annals of Pure and Applied Logic106 (2000), 151–205.
J. R. Steel,Determinacy in the Mitchell models, Annals of Mathematical Logic22 (1982), 109–125.
Author information
Authors and Affiliations
Additional information
This material is based upon work supported by the National Science Foundation under Grant No. DMS-0094174.
Rights and permissions
About this article
Cite this article
Neeman, I. Unraveling Π 11 sets, revisited. Isr. J. Math. 152, 181–203 (2006). https://doi.org/10.1007/BF02771982
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02771982