Related papers: Learning Equivalence Relations on Polish Spaces
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism…
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…
A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learning power of an equivalence relation $E$ on a topological…
We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…
The following will be shown: Let $I$ be a $\sigma$-ideal on a Polish space $X$ with the property that the associated forcing of $I^+$ Borel subsets ordered by $\subseteq$ is a proper forcing. Let E be an analytic or coanalytic equivalence…
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
We study Polish spaces for which a set of possible distances $A \subseteq \mathbb{R}^+$ is fixed in advance. We determine, depending on the properties of $A$, the complexity of the collection of all Polish metric spaces with distances in…
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…
We introduce and study the notion of functorial Borel complexity for Polish groupoids. Such a notion aims at measuring the complexity of classifying the objects of a category in a constructive and functorial way. In the particular case of…
The motivation of this article is to introduce a kind of orbit equivalence relations which can well describe structures and properties of Polish groups from the perspective of Borel reducibility. Given a Polish group $G$, let $E(G)$ be the…
We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…
We present and thoroughly study natural Polish spaces of separable Banach spaces. These spaces are defined as spaces of norms, resp. pseudonorms, on the countable infinite-dimensional rational vector space. We provide an exhaustive…
In inductive inference, we investigate the learnability of classes of formal languages. We are interested in what classes of languages are learnable in certain learning settings. A class of languages is learnable, if there is a learner that…
We study Borel equivalence relations equipped with a uniformly Borel family of Polish topologies on each equivalence class, and more generally, standard Borel groupoids equipped with such a family of topologies on each connected component.…
Given Polish space ${\bf Y}$ and continuous language $L$ we study the corresponding logic $\mathsf{Iso}({\bf Y})$-space ${\bf Y}_L$. We build a framework of generalized model theory towards analysis of Borel/algorithmic complexity of…
This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…
We study the equivalence classes under $\Delta^1_1$ isomorphism, otherwise effective-Borel isomorphism, between complete separable metric spaces which admit a recursive presentation and we show the existence of strictly increasing and…
This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…