Zur Kurzanzeige

dc.contributor.authorBazhenov, Nikolay
dc.contributor.authorMonin, Benoit
dc.contributor.authorSan Mauro, Luca
dc.contributor.authorZamora, Rafael
dc.date.accessioned2021-03-17T11:57:27Z
dc.date.available2021-03-17T11:57:27Z
dc.date.issued2021-03-17
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3849
dc.description.abstractThis preprint offers computational insights into the theory of Borel equivalence relations. Specifically, we classify equivalence relations on the Cantor space up to computable reductions, i.e., reductions induced by Turing functionals. The presented results correspond to three main research focuses: (i) the poset of degrees of equivalence relations on reals under computable reducibility; (ii) the complexity of the equivalence relations generated by computability-theoretic reducibilities $(\leqslant_T , \leqslant_{tt} , \leqslant_m , \leqslant_1 )$, (iii) the effectivization of the notion of hyperfiniteness.en_US
dc.language.isoen_USen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2021-06
dc.titleOn the Computational Content of the Theory of Borel Equivalence Relationsen_US
dc.typePreprinten_US
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.de
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.en
dc.identifier.doi10.14760/OWP-2021-06
local.scientificprogramResearch in Pairs 2020en_US
local.series.idOWP-2021-06en_US
dc.identifier.urnurn:nbn:de:101:1-2021062809210483344858
dc.identifier.ppn1761648241


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige