Abstract
We study the $k$-Borel-reducibility of isomorphism relations of complete first-order theories by using coloured trees. Under some cardinality assumptions, we show the following: For all theories T and T’, if T is classifiable and T’ is unsuperstable, then the isomorphism of models of T’ is strictly above the isomorphism of models of T with respect to $k$-Borel-reducibility.
| Original language | English |
|---|---|
| Pages (from-to) | 1720-1746 |
| Number of pages | 27 |
| Journal | The Journal of Symbolic Logic |
| Volume | 89 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2024 |
Austrian Fields of Science 2012
- 101013 Mathematical logic
Keywords
- Ehrenfeucht-Mostowski models
- classification theory
- coloured trees
- generalized descriptive set theory
- isomorphism
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver