A hanf number for saturation and omission: The superstable case

John T. Baldwin*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Suppose t=(T,T1,p) is a triple of two theories in vocabularies τ⊂τ1 with cardinality λ, T⊆T1 and a τ1-type p over the empty set that is consistent with T1. We consider the Hanf number for the property "there is a model M1 of T1 which omits p, but M1{up harpoon right}τ is saturated". In [2], we showed that this Hanf number is essentially equal to the Löwenheim number of second order logic. In this paper, we show that if T is superstable, then the Hanf number is less than Beth{hebrew}(2(2λ)+)+.

Original languageEnglish
Pages (from-to)437-443
Number of pages7
JournalMathematical Logic Quarterly
Volume60
Issue number6
DOIs
StatePublished - 1 Nov 2014

Bibliographical note

Publisher Copyright:
© 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Fingerprint

Dive into the research topics of 'A hanf number for saturation and omission: The superstable case'. Together they form a unique fingerprint.

Cite this