Distinct volume subsets via indiscernibles

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

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.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,722

External links

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

Through your library

Analytics

Added to PP
2018-09-19

Downloads
9 (#958,531)

6 months
1 (#387,390)

Historical graph of downloads
How can I increase my downloads?

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

Citations of this work

No citations found.

Add more citations

Similar books and articles

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.
Making All Cardinals Almost Ramsey.Arthur W. Apter & Peter Koepke - 2008 - Archive for Mathematical Logic 47 (7-8):769-783.
More Canonical Forms and Dense Free Subsets.Heike Mildenberger - 2004 - Annals of Pure and Applied Logic 125 (1-3):75-99.
Characterization of NIP Theories by Ordered Graph-Indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
Forcing Closed Unbounded Subsets of Ω2.M. C. Stanley - 2001 - Annals of Pure and Applied Logic 110 (1-3):23-87.
Abelian Groups with Modular Generic.James Loveys - 1991 - Journal of Symbolic Logic 56 (1):250-259.
Infinite Lotteries, Large and Small Sets.Luc Lauwers - 2017 - Synthese 194 (6):2203-2209.
Partitioning Subsets of Stable Models.Timothy Bays - 2001 - Journal of Symbolic Logic 66 (4):1899-1908.
Labelling Classes by Sets.M. Victoria Marshall & M. Gloria Schwarze - 2005 - Archive for Mathematical Logic 44 (2):219-226.
Some Remarks on Indiscernible Sequences.Enrique Casanovas - 2003 - Mathematical Logic Quarterly 49 (5):475-478.
Finiteness Classes and Small Violations of Choice.Horst Herrlich, Paul Howard & Eleftherios Tachtsis - 2016 - Notre Dame Journal of Formal Logic 57 (3):375-388.
A Dedekind Finite Borel Set.Arnold W. Miller - 2011 - Archive for Mathematical Logic 50 (1-2):1-17.