Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Hajnal, András
Title: Unsolved and solved problems in set theory. (In English)
Source: Proc. Tarski Symp., internat. Symp. Honor Alfred Tarski, Berkeley 1971, Proc. Symp. Pure Math. 25, 269-287 (1974).
Review: [For the entire collection see Zbl 291.00009.]
The problems in this paper are in the domain of combinatorial set theory. The major part of the paper is a report on solutions, or progress toward solutions, made by themselves and others, on problems in their previous paper [Axiomatic Set Theory, Proc. Sympos. pure Math. 13, Part I, 17-48 (1971; Zbl 228.04001)]. In the last third of the paper, the authors pose and explain nine new problems or groups of problems, of which we list several below (chosen on the basis of brevity).
Problem V (Erdös-Prikry). Let |S| = \aleph1, [S]\aleph1 = \cup\xi < \omega1I\xi. Does there exist \xi < \omega1 and sets A,B,C in I\xi such that A \cup B = C?
Problem VI. Assume G.C.H. Let |S| = \aleph2. Does there exists a disjoint partition [S]2 = \cup\nu < \omega1I\nu satisfying the following condition: For all S' \subset S, |S'| = \aleph2, there is Z \subset S, |Z| = \aleph1 such that all different pairs of Z belong to different I\nu?
Problem IX. Assume G.C.H. and let < S,I > establish \aleph\alpha+1 (not)> ([\aleph\alpha, \aleph\alpha+1])22. (This means that |S| = \aleph\alpha+1, [X]2 \not\subset I for all x in [S]\aleph\alpha and [Y]2 \cap I \ne Ø for all Y in [S]\aleph\alpha+1.) For what \beta \leq \alpha is < Z,g > isomorphic to a substructure of < S,I > for |Z| \leq \aleph\beta?
Classif.: * 04A20 Combinatorial set theory
00A07 Problem books
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag