arXiv:math/0404240 Abstract

arXiv:math/0404240 [math.LO]Abstract References Reviews Resources

The pair $(\aleph_n,\aleph_0)$ may fail $\aleph_0$--compactness

Published 2004-04-13Version 1

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every finite subset of T has a model in K. We then show how we prove it also for n=2, too.

Categories: math.LO

Keywords: compactness, countable first order theory, finite subset, cardinality, distinguished unary predicate

Related articles: Most relevant | Search more

arXiv:1406.5980 [math.LO] (Published 2014-06-23, updated 2014-08-28)

Tameness and frames revisited

Will Boney, Sebastien Vasey

arXiv:math/9204219 [math.LO] (Published 1992-04-15)

Uniformization and the diversity of Whitehead groups

Paul C. Eklof, Alan H. Mekler, Saharon Shelah

arXiv:1704.04751 [math.LO] (Published 2017-04-16)

Compactness of maximal eventually different families

David Schrittesser