Journal of Symbolic Logic 43 (3):572-600 (1978)

Abstract
For T any completion of Peano Arithmetic and for n any positive integer, there is a model of T of size $\beth_n$ with no (n + 1)-length sequence of indiscernibles. Hence the Hanf number for omitting types over T, H(T), is at least $\beth_\omega$ . (Now, using an upper bound previously obtained by Julia Knight H (true arithmetic) is exactly $\beth_\omega$ ). If T ≠ true arithmetic, then $H(T) = \beth_{\omega1}$ . If $\delta \not\rightarrow (\rho)^{ , then any completion of Peano Arithmetic has a model of size δ with no set of indiscernibles of size ρ. There are similar results for theories strongly resembling Peano Arithmetic, e.g., ZF + V = L
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273534
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,268
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

On $N$ -Dependence.Artem Chernikov, Daniel Palacin & Kota Takeuchi - 2019 - Notre Dame Journal of Formal Logic 60 (2):195-214.
Characterization of NIP Theories by Ordered Graph-Indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
Reducts of Random Hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
Karp Complexity and Classes with the Independence Property.M. C. Laskowski & S. Shelah - 2003 - Annals of Pure and Applied Logic 120 (1-3):263-283.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.

View all 10 citations / Add more citations

Similar books and articles

The Argument From Almost Indiscernibles.Gonzalo Rodriguez-Pereyra - 2017 - Philosophical Studies 174 (12):3005-3020.
The Parthood of Indiscernibles.Lidia Obojska - 2019 - Axiomathes 29 (5):427-439.
Saturated Models and Models Generated by Indiscernibles.B. Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
The Identity of Indiscernibles as a Logical Truth.Gerald Keaney - 2007 - Crossroads 1 (2):28-36 Free Online.
Russell and the Identity of Indiscernibles.Michael C. Bradley - 1986 - History of Philosophy Quarterly 3 (3):325 - 333.
Simple Monadic Theories and Indiscernibles.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (1):65-86.

Analytics

Added to PP index
2009-01-28

Total views
35 ( #307,358 of 2,444,934 )

Recent downloads (6 months)
1 ( #457,173 of 2,444,934 )

How can I increase my downloads?

Downloads

My notes