Published September 7, 2022
| Version v1
Journal article
Open
The Turing Degrees and Keisler's Order
Creators
- 1. University of Chicago
- 2. Hebrew University of Jerusalem
Description
There is a Turing functional Φ taking A′ to a theory TA whose complexity is exactly that of the jump of A, and which has the property that A ≤ TB if and only if TA ⊴ TB 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.
Files
Turing-degrees-and-Keislers-order.pdf
Files
(326.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:11a5ea869448855a69d398a6a62a8069
|
326.7 kB | Preview Download |
Additional details
Identifiers
- DOI
- 10.1017/jsl.2022.63
- Other
- oai:uchicago.tind.io:6347
Funding
- National Science Foundation
- 2051825
- BSF
- 3013005232