On the number of dedekind cuts and two-cardinal models of dependent theories

Artem Chernikov*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

For an infinite cardinal κ, let ded κ denote the supremum of the number of Dedekind cuts in linear orders of size κ. It is known that κ < ded κ ≤2κ for all κ and that ded κ < 2κ is consistent for any κ of uncountable cofinality. We prove however that 2κ≤ ded(ded(ded(ded κ))) always holds. Using this result we calculate the Hanf numbers for the existence of two-cardinal models with arbitrarily large gaps and for the existence of arbitrarily large models omitting a type in the class of countable dependent first-order theories. Specifically, we show that these bounds are as large as in the class of all countable theories.

Original languageEnglish
Pages (from-to)771-784
Number of pages14
JournalJournal of the Institute of Mathematics of Jussieu
Volume15
Issue number4
DOIs
StatePublished - 1 Oct 2016

Bibliographical note

Publisher Copyright:
© Cambridge University Press 2015.

Keywords

  • cardinal arithmetic
  • Dedekind cuts
  • dependent theories
  • linear orders
  • NIP
  • omitting types
  • PCF
  • trees
  • two-cardinal models

Fingerprint

Dive into the research topics of 'On the number of dedekind cuts and two-cardinal models of dependent theories'. Together they form a unique fingerprint.

Cite this