Morley’s theorem for gross models
نویسندگان
چکیده
A model M is said to be gross if all infinite definable sets in M have the same cardinality (as M). We prove that if for some uncountable κ, T has a unique gross model of cardinality κ, then for any uncountable κ, T has a unique gross model of cardinality κ.
منابع مشابه
Morley’s Categoricity Theorem
A theory is called κ-categorical, or categorical in power κ, if it has one model up to isomorphism of cardinality κ. Morley’s Categoricity Theorem states that if a theory of first order logic is categorical in some uncountable power κ, then it is categorical in every uncountable power. We provide an elementary exposition of this theorem, by showing that a theory is categorical in some uncountab...
متن کاملA Short Introduction to Classification Theory
0. Introduction 2 1. Stability and ranks 3 PART I: INDEPENDENCE 8 2. Forking 8 3. Indiscernible sets 9 4. Finite equivalence relations 12 5. Further properties of forking 16 6. An example of the use of forking 19 PART II: PRIME MODELS 22 7. General isolation notion 22 8. Examples of isolation notions 26 9. Spectrum of stability 27 10. a -prime models 28 11. Structure of a -saturated models 30 1...
متن کاملUncountable categoricity of local abstract elementary classes with amalgamation
We give a complete and elementary proof of the following upward categoricity theorem: LetK be a local abstract elementary class with amalgamation and joint embedding, arbitrarily large models, and countable LöwenheimSkolem number. If K is categorical in א1 then K is categorical in every uncountable cardinal. In particular, this provides a new proof of the upward part of Morley’s theorem in firs...
متن کاملDescriptive set theory and uncountable model theory
In the early days of the development of model theory it was considered natural and was certainly beneficial to assume that the theories under investigation were in a countable language. The primary advantage of this assumption was the presence of the Omitting Types Theorem of Grzegorczyk, Mostowski, and Ryll-Nardzewski [1], which generalized arguments of Henkin [3] and Orey [8]. Following this,...
متن کاملComputational Origami of a Morley's Triangle
We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process of solving-computing-proving. The whole process is realized by a computational origami system being developed by us. During the computational origami construction, geometric constraints in symbolic and numeric representation are ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002