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 ω, written , 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 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.
Investigating the computable Friedman-Stanley jump
San Mauro L. U. C. A.
2023-01-01
Abstract
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 ω, written , 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 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.File | Dimensione | Formato | |
---|---|---|---|
investigating-the-computable-friedman-stanley-jump.pdf
accesso aperto
Tipologia:
Documento in Versione Editoriale
Licenza:
Creative commons
Dimensione
371.59 kB
Formato
Adobe PDF
|
371.59 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.