Model theory without choice: Categoricity

dc.creatorShelah, Saharon
dc.date2005-04-10
dc.date2008-07-08
dc.date.accessioned2026-07-07T09:48:53Z
dc.date.available2026-07-07T09:48:53Z
dc.descriptionWe prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context: the number of models of a countable first order T of cardinality aleph_alpha is either >=|alpha| for every aleph_αor it has a small upper bound (close to beth_2).
dc.identifierhttps://arxiv.org/abs/math/0504196
dc.identifierhttp://arxiv.org/abs/math/0504196
dc.identifierJ. Symbolic Logic 74 No. 2 (2009) 361--401
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164383
dc.subjectLogic
dc.titleModel theory without choice: Categoricity
dc.typetext

Files

Collections