相关论文: A weak dichotomy below E_1 \times E_3

Using a recent result of C. De Lellis and L. Sz\'{e}kelyhidi Jr. we show that, in the case of periodic boundary conditions and for dimension greater or equal 2, there exist infinitely many global weak solutions to the incompressible Euler…

We prove an analogue of the portmanteau theorem on weak convergence of probability measures allowing measures which are unbounded on an underlying metric space but finite on the complement of any Borel neighbourhood of a fixed element.

We prove that in Solovay model every OD equivalence E on reals either admits an OD reduction to the equality on the set of all countable (of length < omega_1) binary sequences, or continuously embeds E_0, the Vitali equivalence. If E is a…

We study propositional proof systems with inference rules that formalize restricted versions of the ability to make assumptions that hold without loss of generality, commonly used informally to shorten proofs. Each system we study is built…

Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…

We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…

The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

In this paper, we obtain the necessary and sufficient condition that two knot projections are related by a finite sequence of the first and second flat Reidemeister moves (Theorem 1). We also consider an equivalence relation that is called…

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),…

For nonautonomous linear difference equations, we introduce the notion of the so-called nonuniform dichotomy spectrum and prove a spectral theorem. Moreover, we introduce the notion of weak kinematical similarity and prove a reducibility…

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…

Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…