Categoricity in Infinitary Logic If is categorical in for then it is categorical in arbitrarily larger cardinals (larger than the Hanf number).
- If (i.e., no weak upwards Löwenheim-Skolem property) then arbitrary categoricity is not guaranteed from any ‘point’ (cardinal). E.g., may be -categorical for any infinite cardinal , but not categorical in any other cardinal. This may also occur for for denotes the Hanf number for the property of categoricity.
Background Information
Shelah’s presentation theorem: If is an AEC in a vocabulary w/ , then there is a vocabulary w/ cardinality , a first-order () theory of vocabulary , and a set of at most partial types such that:
Categoricity Transference: Categoricity transference is a property where categoricity in a certain cardinal transfers (‘implies’) downwards or upwards to another cardinal (this is achieved via the Hanf number for categoricity).
Notation: denotes a property that applies to an AEC in cardinality
Theorem: For a fixed set of classes of a given kind (e.g., the classes of models defined by the infinitary logic for some fixed of a given vocabulary). For any ‘property’ there is a cardinal such that is holds for some , then holds for arbitrarily large . Proof: Let sup, then sup as ranges over the set of all classes of a given type
Since there are a proper-class of sentences in (that forms a proper-class for an arbitrary vocabulary ), there are a proper-class of AEC with a given vocabulary.
Notation: For any AEC , let sup, where denotes the vocabulary (or ‘similarity type’) of the AEC , and denotes the Löwenheim number of .
For any cardinal , there is only set-many AEC with since the AEC is determined via its restriction to model below the Löwenheim number (given a fixed vocabulary ).
A property is downwards closed if there is a such that if holds with , then holds if .
Theorem: If a property is downwards closed, then for any there is a cardinal for any AEC w/ , if some model w/ property has cardinality greater than (), then there is a model w/ property in all cardinals . i.e., if an AEC is downwards closed for a property , there is a Hanf number for
Hanf Number for Properties: The Hanf number for a property for an AEC w/ is if there is a model w/ cardinality that has property , then there is a model in all cardinalities greater than . Hanf’s argument can be applied via replacing w/ , i.e., instead of
We may then consider the property of categoricity, that is, every model of cardinality is isomorphic to , and so consider a Hanf number for categoricity (see below).
Hanf Number Construction: i) A first-order type is a consistent set of first-order formulae in a fixed number of finite variables. We say that is a complete type over a set if every formula w/ parameters from (or it’s negation) is in ii) Let denote the least cardinal such that if a first-order theory w/ has models of every cardinality which omit each of a set of types. We call the Hanf function for omitting types for theories of size It is often written in the case of iii) We write for iv) For a vocabulary means . W/ a fixed , we write for
Corollaries:
- If is an AEC and there is some such that , then has arbitrarily large models (i.e., There is a such that for all , then )
When , then is often called the Hanf number of . This is further equal to assuming (or for ) Note: This is a bit misleading as a single AEC cannot have a Hanf number, (a Hanf number is a maximum of all sentences and for all vocabularies of a given cardinality, as well as a fixed Löwenheim number for AEC’s). Rather the Hanf number for all AEC w/ the same . For any model w/ where , there are models of all cardinalities in the class that omit all types omitted in .
Notes:
- If the AEC is not fixed, then the Hanf number is a function of the (cardinality of the) vocabulary, .
- , use is different in the specific context
- is an upper bound for the Hanf number (given it exists). Thus, it is possible for the Hanf number to smaller than , but not larger. i.e., Considering first-order logic () w/ in a countable language, and so the upper bound is , even though by Morley’s categoricity theorem it is . By Shelah’s generalization, the Hanf number for first-order logic in an uncountable language of size , is . The reason for the use of Beth numbers is because it has been proven by Barwise that the Hanf number of any abstract logic corresponds to some Beth , and the Hanf number for infinitary logics is the Beth of the successor.
Hanf numbers as described here: The Hanf Number, is the Hanf number for the property of the existence of models.
Categoricity Transference
A larger Hanf number can be defined as follows: if is fixed. Naturally this that we build a sequence of successively larger Hanf numbers where and
The Hanf number is the Hanf number for arbitrarily large models (this ‘depends’ on the size of the vocabulary and the Löwenheim Number ). While the Hanf number is used for tameness and locality assumptions, this can be used to show categoricity transference. i.e., For an AEC that satisfies the amalgamation property (AP) and joint embedding property (JEP) and is categorical in & , it can be shown that for some then it is categorical in all . Assuming is -tame for some allows one to extend this conclusion to all categoricity in all .
We apply the Hanf function again to yield , the Hanf number for categoricity transference because below , models of arbitrary cardinalities is not guaranteed.
Downwards Categoricity Transference: Similar to how categoricity can be ‘transferred’ upwards from to a successor cardinal which can yield categoricity for an AEC in arbitrarily large cardinals., categoricity can also be transferred downwards.
Theorem 14.14: Suppose is categorical in some w/ and either i) is -categorical; or ii) admits -saturated unions then, i) is categorical in every w/ ; ii) If is also -weakly tame is categorical in every w/ .
Theorem 15.11: Suppose and that has arbitrarily large models, the amalgamation property, and joint embedding property. Suppose is -categorical, then i) is categorical in all cardinals ii) If is -tame for some , then is -categorical for all Where
Conclusion 15.13: There is a cardinal depending on such that if is an AEC , and is categorical in some successor cardinal , then is categorical in all cardinal greater than .
Proof: There are only set-many AEC w/ . Let given that such a supremum exists. Then let be the maximum of and . If and is categorical in some successor cardinal greater than , then is categorical in arbitrarily large successor cardinals and in all cardinals greater than via theorem 15.11.
Notes:
- The smallest possible lower bound for an arbitrary infinitary sentence to be categorical is For any there is a sentence of w/ no models in cardinals greater than and w/ many models in each cardinal below . If asserts that the language contains only equality, then is -categorical for (this property fails the amalgamation and joint embedding properties).
- Since . If (i.e., there isn’t a point where arbitrarily large models are guaranteed), then (i.e., there isn’t a point where categoricity isn’t transferred arbitrarily upwards) and vice versa as .
References
Categoricity Abstract Elementary Classes Stability Theory The Hanf Number Classification Theory AEClec.pdf