| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DataCite | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Files
Abstract
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.