Finitely Based Theories

Hrushovski, Ehud

J. Symbolic Logic, Tome 54 (1989) no. 1, p. 221-225 / Harvested from Project Euclid

Résumé

A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjectures.

Publié le : 1989-03-14
Classification:

@article{1183742862,
     author = {Hrushovski, Ehud},
     title = {Finitely Based Theories},
     journal = {J. Symbolic Logic},
     volume = {54},
     number = {1},
     year = {1989},
     pages = { 221-225},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742862}
}

Hrushovski, Ehud. Finitely Based Theories. J. Symbolic Logic, Tome 54 (1989) no. 1, pp.  221-225. http://gdmltest.u-ga.fr/item/1183742862/