Indiscernible extraction and Morley sequences

DOI10.1215/00294527-3800865MaRDI QIDQ509610zbMATH OpenOpenAlexFDO

Publication date 17 February 2017

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.5763

dual finite character forking Morley sequences simple theory

Foundations of classical theories (including reverse mathematics) (03B30) Classification theory, stability, and related concepts in model theory (03C45) Partition relations (03E02) Axiomatics of classical set theory and its fragments (03E30)

Abstract: We present a new proof of the existence of Morley sequences in simple theories. We avoid using the ErdH{o}s-Rado theorem and instead use only Ramsey's theorem and compactness. The proof shows that the basic theory of forking in simple theories can be developed using only principles from "ordinary mathematics", answering a question of Grossberg, Iovino and Lessmann, as well as a question of Baldwin.

Review text

The author gives a new proof of the existence of Morley sequences in simple theories. Instead of building a very large independent sequence first and then using the Erdős-Rado theorem together with Morley's method, he only uses Ramsey's theorem and compactness. The construction relies on a property of forcing, called by the author dual finite character. He answers a question asked by \textit{R. Grossberg} et al. [Arch. Math. Logic 41, No. 6, 541--580 (2002; Zbl 1024.03029)] and \textit{J. T. Baldwin} [``How big should the monster model be?, in: Logic without borders. Essays on set theory, model theory, philosophical logic and philosophy of mathematics. Berlin: De Gruyter. 30--51 (2015; \url{doi:10.1515/9781614516873.31})] .

Recommendations

Cited in

(3)

This page was built for publication: Indiscernible extraction and Morley sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509610)