Characterization of NIP theories by ordered graph-indiscernibles

Annals of Pure and Applied Logic 163 (11):1624-1641 (2012)
  Copy   BIBTEX

Abstract

We generalize the Unstable Formula Theorem characterization of stable theories from Shelah [11], that a theory T is stable just in case any infinite indiscernible sequence in a model of T is an indiscernible set. We use a generalized form of indiscernibles from [11], in our notation, a sequence of parameters from an L-structure M, , indexed by an L′-structure I is L′-generalized indiscernible inM if qftpL′=qftpL′ implies tpL=tpL for all same-length, finite ¯,j from I. Let Tg be the theory of linearly ordered graphs in the language with signature Lg={<,R}. Let Kg be the class of all finite models of Tg. We show that a theory T has NIP if and only if any Lg-generalized indiscernible in a model of T indexed by an Lg-structure with age equal to Kg is an indiscernible sequence

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,667

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

Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
Some remarks on indiscernible sequences.Enrique Casanovas - 2003 - Mathematical Logic Quarterly 49 (5):475-478.
Classifiable theories without finitary invariants.E. Bouscaren & E. Hrushovski - 2006 - Annals of Pure and Applied Logic 142 (1-3):296-320.
Distinct volume subsets via indiscernibles.William Gasarch & Douglas Ulrich - 2019 - Archive for Mathematical Logic 58 (3-4):469-483.
On the existence of indiscernible trees.Kota Takeuchi & Akito Tsuboi - 2012 - Annals of Pure and Applied Logic 163 (12):1891-1902.
On uniform definability of types over finite sets.Vincent Guingona - 2012 - Journal of Symbolic Logic 77 (2):499-514.

Analytics

Added to PP
2013-10-27

Downloads
29 (#837,578)

6 months
8 (#476,836)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tree indiscernibilities, revisited.Byunghan Kim, Hyeung-Joon Kim & Lynn Scow - 2014 - Archive for Mathematical Logic 53 (1-2):211-232.
On $n$ -Dependence.Artem Chernikov, Daniel Palacin & Kota Takeuchi - 2019 - Notre Dame Journal of Formal Logic 60 (2):195-214.
Indiscernibles, EM-Types, and Ramsey Classes of Trees.Lynn Scow - 2015 - Notre Dame Journal of Formal Logic 56 (3):429-447.
Ramsey transfer to semi-retractions.Lynn Scow - 2021 - Annals of Pure and Applied Logic 172 (3):102891.

View all 12 citations / Add more citations

References found in this work

On ◁∗-maximality.Mirna Džamonja & Saharon Shelah - 2004 - Annals of Pure and Applied Logic 125 (1-3):119-158.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
The stability spectrum for classes of atomic models.John T. Baldwin & Saharon Shelah - 2012 - Journal of Mathematical Logic 12 (1):1250001-.
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.

Add more references