EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP

URI ANDREWS, LUCA SAN MAURO

The Journal of Symbolic Logic · 2024-06 · 89 (2) · 918-944

DOI: 10.1017/jsl.2023.30 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 17.05.2023. Verfasst von URI ANDREWS und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Friedman–Stanley jump, extensively studied by descriptive set theorists, is a fundamental tool for gauging the complexity of Borel isomorphism relations. This paper focuses on a natural computable analog of this jump operator for equivalence relations on $\omega $ , written ${\dotplus }$ , recently introduced by Clemens, Coskey, and Krakoff. We offer a thorough analysis of the computable Friedman–Stanley jump and its connections with the hierarchy of countable equivalence relations under the computable reducibility $\leq _c$ . In particular, we show that this jump gives benchmark equivalence relations going up the hyperarithmetic hierarchy and we unveil the complicated highness hierarchy that arises from ${\dotplus }$ .

Zitieren

APA

ANDREWS, U., & MAURO, L. S. (2024). INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP. The Journal of Symbolic Logic, 89(2), 918-944. https://doi.org/10.1017/jsl.2023.30

Vancouver

ANDREWS U, MAURO LS. INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP. The Journal of Symbolic Logic. 2024;89(2):918-944. doi:10.1017/jsl.2023.30

BibTeX
@article{ANDREWS2024,
  author = {ANDREWS, URI and MAURO, LUCA SAN},
  title = {INVESTIGATING THE COMPUTABLE FRIEDMAN–STANLEY JUMP},
  journal = {The Journal of Symbolic Logic},
  year = {2024},
  volume = {89},
  number = {2},
  pages = {918--944},
  doi = {10.1017/jsl.2023.30}
}
Kostenlos starten →