ArticleOriginal scientific text

Title

Borel sets with large squares

Authors 1, 2

Affiliations

  1. Institute of Mathematics, The Hebrew University, Jerusalem 91904, Israel
  2. Mathematics Department, Rutgers University, New Brunswick, New Jersey 08854, U.S.A.

Abstract

 For a cardinal μ we give a sufficient condition μ (involving ranks measuring existence of independent sets) for: μ if a Borel set B ⊆ ℝ × ℝ contains a μ-square (i.e. a set of the form A × A with |A| =μ) then it contains a 20-square and even a perfect square, and also for μ if ψLω1,ω has a model of cardinality μ then it has a model of cardinality continuum generated in a "nice", "absolute" way. Assuming MA+20>μ for transparency, those three conditions (μ, μ and μ) are equivalent, and from this we deduce that e.g. α<ω1[20αα], and also that min{μ:μ}, if <20, has cofinality 1.   We also deal with Borel rectangles and related model-theoretic problems.

Bibliography

  1. [CK] C. C. Chang and J. H. Keisler, Model Theory, Stud. Logic Found. Math. 73, North-Holland, Amsterdam, 1973.
  2. [EHMR] P. Erdős, A. Hajnal, A. Máté and R. Rado, Combinatorial Set Theory: Partition Relations for Cardinals, Stud. Logic Found. Math. 106, North-Holland, Amsterdam, 1984.
  3. [GcSh 491] M. Gilchrist and S. Shelah, Identities on cardinals less than ω, J. Symbolic Logic 61 (1996), 780-787.
  4. [HrSh 152] L. Harrington and S. Shelah, Counting equivalence classes for co-κ-Suslin equivalence relations, in: Logic Colloquium '80 (Prague, 1980), D. van Dalen et al. (eds.), Stud. Logic Found. Math. 108, North-Holland, Amsterdam, 1982, 147-152.
  5. [Ke71] H. J. Keisler, Model Theory for Infinitary Logic. Logic with Countable Conjunctions and Finite Quantifiers, Stud. Logic Found. Math. 62, North-Holland, Amsterdam, 1971.
  6. [Mo] M. Morley, Omitting classes of elements, in: The Theory of Models, North-Holland, 1965, 265-273.
  7. [Sh a] S. Shelah, Classification Theory and the Number of Nonisomorphic Models, Stud. Logic Found. Math. 92, North-Holland, Amsterdam, xvi+544 pp., 1978.
  8. [Sh c] S. Shelah, Classification Theory and the Number of Nonisomorphic Models, Stud. Logic Found. Math. 92, North-Holland, Amsterdam, xxxiv+705 pp., 1990.
  9. [Sh e] S. Shelah, Non-Structure Theory, Oxford Univ. Press, in preparation.
  10. [Sh g] S. Shelah, Cardinal Arithmetic, Oxford Logic Guides 29, Oxford Univ. Press, 1994.
  11. [Sh 8] S. Shelah, Two cardinal compactness, Israel J. Math. 9 (1971), 193-198; see also Notices Amer. Math. Soc. 18 (1971), 425.
  12. [Sh 18] S. Shelah, On models with power-like orderings, J. Symbolic Logic 37 (1972), 247-267.
  13. [Sh 37] S. Shelah, A two-cardinal theorem, Proc. Amer. Math. Soc. 48 (1975), 207-213.
  14. [Sh 49] S. Shelah, A two-cardinal theorem and a combinatorial theorem, ibid. 62 (1976), 134-136.
  15. [Sh 202] S. Shelah, On co-κ-Suslin relations, Israel J. Math. 47 (1984), 139-153.
  16. [Sh 262] S. Shelah, The number of pairwise non-elementarily-embeddable models, J. Symbolic Logic 54 (1989), 1431-1455.
  17. [Sh 288] S. Shelah, Strong partition relations below the power set: consistency, was Sierpiński right? II, in: Sets, Graphs and Numbers (Budapest, 1991), Colloq. Math. Soc. János Bolyai 60, North-Holland, 1992, 637-638.
  18. [Sh 532] S. Shelah, More on co-κ-Suslin equivalence relations, in preparation.
Pages:
1-50
Main language of publication
English
Received
1994-02-28
Accepted
1996-12-23
Published
1999
Exact and natural sciences