Abstract
We construct a countable simple theory which, in Keisler’s order, is strictly above the random graph and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a result we prove in ZFC that there are incomparable classes in Keisler’s order.
| Original language | English |
|---|---|
| Pages (from-to) | 121-151 |
| Number of pages | 31 |
| Journal | Contemporary Mathematics |
| Volume | 752 |
| DOIs | |
| State | Published - 2020 |
Bibliographical note
Publisher Copyright:© 2020 American Mathematical Society.
Fingerprint
Dive into the research topics of 'An example of a new simple theory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver