Abstract
There is a Turing functional taking to a theory whose complexity is exactly that of the jump of A, and which has the property that if and only if in Keisler's order. In fact, by more elaborate means and related theories, we may keep the complexity at the level of A without using the jump.
Original language | English |
---|---|
Pages (from-to) | 331-341 |
Number of pages | 11 |
Journal | Journal of Symbolic Logic |
Volume | 89 |
Issue number | 1 |
DOIs | |
State | Published - 7 Mar 2024 |
Bibliographical note
Publisher Copyright:© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic.
Keywords
- classification theory
- Keisler's order
- regular ultrapowers
- Turing degrees.