|
A short proof of Ellentuck's Theorem
Author(s):
Pierre
Matet
Journal:
Proc. Amer. Math. Soc.
129
(2001),
1195-1197.
MSC (2000):
Primary 03E05
Posted:
October 4, 2000
MathSciNet review:
1709762
Retrieve article in:
PDF
This article is available free of charge
Abstract |
References |
Similar articles |
Additional information
Abstract:
We combine standard arguments to give a shorter proof of Ellentuck's Theorem.
References:
-
- 1.
- F. Galvin and K. Prikry, Borel sets and Ramsey's theorem, Journal of Symbolic Logic 38 (1973), 193-198. MR 49:2399
- 2.
- E. Ellentuck, A new proof that analytic sets are Ramsey, Journal of Symbolic Logic 39 (1974), 163-165. MR 50:1887
- 3.
- A. R. D. Mathias, Happy families, Annals of Mathematical Logic 12 (1977), 59-111. MR 58:10462
Similar Articles:
Retrieve articles in Proceedings of the American Mathematical
Society
with
MSC (2000):
03E05
Retrieve articles in all Journals with
MSC (2000):
03E05
Additional Information:
Pierre
Matet
Affiliation:
Université de Caen-CNRS, ESA 6081, Laboratoire SDAD, Campus II, 14032 Caen Cedex, France
Email:
matet@math.unicaen.fr
DOI:
10.1090/S0002-9939-00-05653-7
PII:
S 0002-9939(00)05653-7
Received by editor(s):
March 23, 1999
Received by editor(s) in revised form:
June 21, 1999
Posted:
October 4, 2000
Dedicated:
Dedicated to Adrian Mathias
Communicated by:
Carl G. Jockusch, Jr.
Copyright of article:
Copyright
2000,
American Mathematical Society
|
