Abstract
We continue investigating the strength of monadic logic in elementary classes. Mainly we show that all stable unsuperstable theories with finite vocabulary are either among the (easily definable class of) hopelessly complicated or are essentially as complicated as a variant of the tree {Mathematical expression}.
Original language | English |
---|---|
Pages (from-to) | 353-364 |
Number of pages | 12 |
Journal | Israel Journal of Mathematics |
Volume | 70 |
Issue number | 3 |
DOIs | |
State | Published - Oct 1990 |