Distinct volume subsets via indiscernibles

Archive for Mathematical Logic 58 (3-4):469-483 (2019)
  Copy   BIBTEX

Abstract

Erdős proved that for every infinite \ there is \ with \, such that all pairs of points from Y have distinct distances, and he gave partial results for general a-ary volume. In this paper, we search for the strongest possible canonization results for a-ary volume, making use of general model-theoretic machinery. The main difficulty is for singular cardinals; to handle this case we prove the following. Suppose T is a stable theory, \ is a finite set of formulas of T, \, and X is an infinite subset of M. Then there is \ with \ and an equivalence relation E on Y with infinitely many classes, each class infinite, such that Y is \\)-indiscernible. We also consider the definable version of these problems, for example we assume \ is perfect and we find some perfect \ with all distances distinct. Finally we show that Erdős’s theorem requires some use of the axiom of choice.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

No decreasing sequence of cardinals.Paul Howard & Eleftherios Tachtsis - 2016 - Archive for Mathematical Logic 55 (3-4):415-429.
Generalizations of Cantor's theorem in ZF.Guozhen Shen - 2017 - Mathematical Logic Quarterly 63 (5):428-436.
The spectrum of maximal independent subsets of a Boolean algebra.J. Donald Monk - 2004 - Annals of Pure and Applied Logic 126 (1-3):335-348.
Characterization of NIP theories by ordered graph-indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
Making all cardinals almost Ramsey.Arthur W. Apter & Peter Koepke - 2008 - Archive for Mathematical Logic 47 (7-8):769-783.
Σ1(κ)-definable subsets of H.Philipp Lücke, Ralf Schindler & Philipp Schlicht - 2017 - Journal of Symbolic Logic 82 (3):1106-1131.
Some remarks on indiscernible sequences.Enrique Casanovas - 2003 - Mathematical Logic Quarterly 49 (5):475-478.

Analytics

Added to PP
2018-09-19

Downloads
15 (#949,588)

6 months
2 (#1,449,525)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
[Omnibus Review].Akihiro Kanamori - 1981 - Journal of Symbolic Logic 46 (4):864-866.

Add more references