LEARNING EQUIVALENCE RELATIONS ON POLISH SPACES
The Journal of Symbolic Logic · 03.02.2025 · 1-19
DOI: 10.1017/jsl.2025.7 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Journal of Symbolic Logic, online erschienen am 03.02.2025. Verfasst von DINO ROSSEGGER und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We investigate natural variations of behaviourally correct learning and explanatory learning—two learning paradigms studied in algorithmic learning theory—that allow us to “learn” equivalence relations on Polish spaces. We give a characterization of the learnable equivalence relations in terms of their Borel complexity and show that the behaviourally correct and explanatory learnable equivalence relations coincide both in uniform and non-uniform versions of learnability and provide a characterization of the learnable equivalence relations in terms of their Borel complexity. We also show that the set of uniformly learnable equivalence relations is $\boldsymbol {\Pi }^1_1$ -complete in the codes and study the learnability of several equivalence relations arising naturally in logic as a case study.
Zitieren
APA
ROSSEGGER, D., SLAMAN, T., & STEIFER, T. (2025). LEARNING EQUIVALENCE RELATIONS ON POLISH SPACES. The Journal of Symbolic Logic, 1-19. https://doi.org/10.1017/jsl.2025.7
Vancouver
ROSSEGGER D, SLAMAN T, STEIFER T. LEARNING EQUIVALENCE RELATIONS ON POLISH SPACES. The Journal of Symbolic Logic. 2025:1-19. doi:10.1017/jsl.2025.7
BibTeX
@article{ROSSEGGER2025,
author = {ROSSEGGER, DINO and SLAMAN, THEODORE and STEIFER, TOMASZ},
title = {LEARNING EQUIVALENCE RELATIONS ON POLISH SPACES},
journal = {The Journal of Symbolic Logic},
year = {2025},
pages = {1--19},
doi = {10.1017/jsl.2025.7}
}
EUVIMED