Some remarks on indiscernible sequences

Mathematical Logic Quarterly 49 (5):475-478 (2003)
  Copy   BIBTEX

Abstract

We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

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

Some remarks on indiscernible sequences.Enrique Casanovas Ruiz-Fornells - 2003 - Mathematical Logic Quarterly 49 (5):475.
Characterization of NIP theories by ordered graph-indiscernibles.Lynn Scow - 2012 - Annals of Pure and Applied Logic 163 (11):1624-1641.
Indiscernible Extraction and Morley Sequences.Sebastien Vasey - 2017 - Notre Dame Journal of Formal Logic 58 (1):127-132.
Remarks on the NIP in a model.Karim Khanaki & Anand Pillay - 2018 - Mathematical Logic Quarterly 64 (6):429-434.
Distinct volume subsets via indiscernibles.William Gasarch & Douglas Ulrich - 2019 - Archive for Mathematical Logic 58 (3-4):469-483.
A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
Theories without the tree property of the second kind.Artem Chernikov - 2014 - Annals of Pure and Applied Logic 165 (2):695-723.

Analytics

Added to PP
2013-12-01

Downloads
35 (#653,582)

6 months
5 (#1,071,419)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Thorn-forking as local forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):21-38.

Add more citations

References found in this work

Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
An introduction to forking.Daniel Lascar & Bruno Poizat - 1979 - Journal of Symbolic Logic 44 (3):330-350.
Definability in low simple theories.Ziv Shami - 2000 - Journal of Symbolic Logic 65 (4):1481-1490.
Forking and fundamental order in simple theories.Daniel Lascar & Anand Pillay - 1999 - Journal of Symbolic Logic 64 (3):1155-1158.

Add more references