The pair $(\aleph_n,\aleph_0)$ may fail $\aleph_0$--compactness
| dc.creator | Shelah, Saharon | |
| dc.date | 2004-04-13 | |
| dc.date.accessioned | 2026-07-07T05:07:24Z | |
| dc.date.available | 2026-07-07T05:07:24Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0404240 | |
| dc.identifier | http://arxiv.org/abs/math/0404240 | |
| dc.identifier | in: {Logic Colloquium '01} (2005) 402--433 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70846 | |
| dc.subject | Logic | |
| dc.title | The pair $(\aleph_n,\aleph_0)$ may fail $\aleph_0$--compactness | |
| dc.type | text |