Related papers: Borel-amenable Reducibilities for Sets of Reals

For each $a \in \mathbb{R}$, we define a Borel function $f_a : \mathbb{R} \to \mathbb{R}$ which encodes $a$ in a certain sense. We show that for each Borel $g : \mathbb{R} \to \mathbb{R}$, $f_a \cap g = \emptyset$ implies $a \in…

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

We want to give a construction as simple as possible of a Borel subset of a product of two Polish spaces. This introduces the notion of potential Wadge class. Among other things, we study the non-potentially closed sets, by proving…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

The well-known Bohr--P\'al theorem asserts that for every continuous real-valued function $f$ on the circle $\mathbb T$ there exists a change of variable, i.e., a homeomorphism $h$ of $\mathbb T$ onto itself, such that the Fourier series of…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We prove the following classification theorem of the ``Glimm -- Effros'' type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order $\meo$ which is not…

Let X be an irreducible variety and Bir(X) its group of birational transformations. We show that the group structure of Bir(X) determines whether X is rational and whether X is ruled. Additionally, we prove that any Borel subgroup of Bir(X)…

In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the…

This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…

In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable iff it is in the second ambiguous class (boldface Delta^0_2), iff it is…

All spaces are assumed to be separable and metrizable. We give a complete classification of the zero-dimensional homogeneous spaces, under the Axiom of Determinacy. This classification is expressed in terms of topological complexity (in the…

The aim of this paper is to study the relationship between reduction numbers and Borel-fixed ideals in all characteristics. By definition, Borel-fixed ideals are closed under certain specializations which is similar to the strong stability.…

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

We show that the Dual Borel Conjecture implies that ${\mathfrak d}> \aleph_1$ and find some topological characterizations of perfectly meager and universally meager sets.

Let N be a square-free positive integer and let f be a newform of weight 2 on \Gamma_0(N). Let A denote the abelian subvariety of J_0(N) associated to f and let m be a maximal ideal of the Hecke algebra T that contains Ann_T(f) and has…

In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…

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…

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…

It is known that the topology of a Polish group is uniquely determined by its Borel structure and group operations, but this does not give us a way to find the topology. In this article we expand on this theorem and give a criterion for a…