A short proof of Ellentuck’s Theorem
HTML articles powered by AMS MathViewer
- by Pierre Matet PDF
- Proc. Amer. Math. Soc. 129 (2001), 1195-1197 Request permission
Abstract:
We combine standard arguments to give a shorter proof of Ellentuck’s Theorem.References
- Fred Galvin and Karel Prikry, Borel sets and Ramsey’s theorem, J. Symbolic Logic 38 (1973), 193–198. MR 337630, DOI 10.2307/2272055
- Erik Ellentuck, A new proof that analytic sets are Ramsey, J. Symbolic Logic 39 (1974), 163–165. MR 349393, DOI 10.2307/2272356
- A. R. D. Mathias, Happy families, Ann. Math. Logic 12 (1977), no. 1, 59–111. MR 491197, DOI 10.1016/0003-4843(77)90006-7
Additional Information
- Pierre Matet
- Affiliation: Université de Caen-CNRS, ESA 6081, Laboratoire SDAD, Campus II, 14032 Caen Cedex, France
- Email: matet@math.unicaen.fr
- Received by editor(s): March 23, 1999
- Received by editor(s) in revised form: June 21, 1999
- Published electronically: October 4, 2000
- Communicated by: Carl G. Jockusch, Jr.
- © Copyright 2000 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 129 (2001), 1195-1197
- MSC (2000): Primary 03E05
- DOI: https://doi.org/10.1090/S0002-9939-00-05653-7
- MathSciNet review: 1709762
Dedicated: Dedicated to Adrian Mathias