Uncountable Theories that are Categorical in a Higher Power
Laskowski, Michael Chris
J. Symbolic Logic, Tome 53 (1988) no. 1, p. 512-530 / Harvested from Project Euclid
In this paper we prove three theorems about first-order theories that are categorical in a higher power. The first theorem asserts that such a theory either is totally categorical or there exist prime and minimal models over arbitrary base sets. The second theorem shows that such theories have a natural notion of dimension that determines the models of the theory up to isomorphism. From this we conclude that $I(T, \aleph_\alpha) = \aleph_0 + |\alpha|$ where $\aleph_\alpha =$ the number of formulas modulo $T$-equivalence provided that $T$ is not totally categorical. The third theorem gives a new characterization of these theories.
Publié le : 1988-06-14
Classification: 
@article{1183742639,
     author = {Laskowski, Michael Chris},
     title = {Uncountable Theories that are Categorical in a Higher Power},
     journal = {J. Symbolic Logic},
     volume = {53},
     number = {1},
     year = {1988},
     pages = { 512-530},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742639}
}
Laskowski, Michael Chris. Uncountable Theories that are Categorical in a Higher Power. J. Symbolic Logic, Tome 53 (1988) no. 1, pp.  512-530. http://gdmltest.u-ga.fr/item/1183742639/