THE TURING DEGREES and KEISLER'S ORDER

Maryanthe Malliaris, Saharon Shelah

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)331-341
Number of pages11
JournalJournal of Symbolic Logic
Volume89
Issue number1
DOIs
StatePublished - 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.

Fingerprint

Dive into the research topics of 'THE TURING DEGREES and KEISLER'S ORDER'. Together they form a unique fingerprint.

Cite this