Related papers: Essential countability of treeable equivalence rel…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular…
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…
This text is about the mathematical use of certain divergent power series. The first part is an introduction to 1-summability. The definitions rely on the formal Borel transform and the Laplace transform along an arbitrary direction of the…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
We investigate a relations of almost isometric embedding and almost isometry between metric spaces and prove that with respect to these relations: (1) There is a countable universal metric space. (2) There may exist fewer than continuum…
We prove several new theorems regarding first homology. Some dichotomies for first homology of Peano continua are presented, as well as a notion of strong abelianization for arbitrary path connected metric spaces. We also show that the…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
We prove that the topological conjugacy relations both for minimal systems and pointed minimal systems are not Borel-reducible to any Borel $S_{\infty}$-action.
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
In 2020, Calderoni, Marker, Motto Ros and Shani asked what the Borel complexity of the isomorphism relation of Archimedean orders on $\mathbb{Q}^n$ is. We answer this question by proving that the isomorphism relation of Archimedean orders…
We answer one of the main questions in generalized descriptive set theory, the Friedman-Hyttinen-Kulikov conjecture on the Borel reducibility of the Main Gap. We show a correlation between Shelah's Main Gap and generalized Borel…
For a metric compact space $L$ and a Banach space $E$, we provide a characterization of the complementability of the Banach space $\mathcal{C}(L)$ of continuous functions on $L$ inside $E$ in terms of the existence of a certain tree in the…
We provide a sufficient condition that ensures the nilpotency of endomorphisms universally of trace zero of Schur-finite objects in a category of homological type, i.e., a Q-linear tensor category with a tensor functor to super vector…
It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
In this article we study exponential dichotomies for noninvertible linear difference equations in finite dimensions. After giving the definition, we study the extent to which the projection $P(k)$ in a dichotomy is unique. For equations on…
We prove that in Borel models of arithmetic on an uncountable Polish space, neither addition nor multiplication is continuous. This is an analogue of Tennenbaum's Theorem for topological models of arithmetic. This answers a question of…
We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…
We consider ergodic $\mathrm{Sym}(\mathbb{N})$-invariant probability measures on the space of $L$-structures with domain $\mathbb{N}$ (for $L$ a countable relational language), and call such a measure a properly ergodic structure when no…