Related papers: The Complexity of Connectedness Relations on Polis…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
In this paper, we deal with the classification complexity of continuous (Devaney) chaotic systems in dimensions $0,1$ and $\infty$ using the framework of invariant descriptive set theory. We identify the complexity in dimensions $0$ and…
A topological space is almost locally compact if it contains a dense locally compact subspace. We generalize a result from \cite{Ma}, showing that isomorphism on Borel classes of almost locally compact Polish metric structures is always…
We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…
Let $X$ be a Polish space, $d$ a pseudo-metric on $X$. If $\{(u,v):d(u,v)<\delta\}$ is ${\bf\Pi}^1_1$ for each $\delta>0$, we show that either $(X,d)$ is separable or there are $\delta>0$ and a perfect set $C\subseteq X$ such that…
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to…
This paper contains results concerning the Borel reduction of the relation $E_0$ of eventual agreement between sequences of 0's and 1's, to the relation of permutative equivalence between basic sequences in a Banach space. For more clarity…
We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…
It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…
Following the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok and J. Zapletal we study Borel equivalences on Laver trees. Here we prove that equivalence relations Borel reducible to an equivalence relation…
The 2013 logic blog has focussed on the following: 1. Higher randomness. Among others, the Borel complexity of $\Pi^1_1$ randomness and higher weak 2 randomness is determined. 2. Reverse mathematics and its relationship to randomness. For…
This paper surveys some recent developments in measures of association related to a new coefficient of correlation introduced by the author. A straightforward extension of this coefficient to standard Borel spaces (which includes all Polish…
For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…
A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and…
We prove that for a countable discrete group $\Gamma$ containing a copy of the free group $\F_n$, for some $2\leq n\leq\infty$, as a normal subgroup, the equivalence relations of conjugacy, orbit equivalence and von Neumann equivalence of…
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…
We first explain how to endow the space of subequivalence relations of any non-singular countable equivalence relation with a Polish topology, extending the framework of Kechris' recent monograph on subequivalence relations of probability…
We provide a complete classification, up to order-isomorphism, of all possible Wadge hierarchies on zero-dimensional Polish spaces using (essentially) countable ordinals as complete invariants. We also observe that although our assignment…