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

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

Let $X_n, n\in\Bbb N$ be a sequence of non-empty sets, $\psi_n:X_n^2\to\Bbb R^+$. We consider the relation $E((X_n,\psi_n)_{n\in\Bbb N})$ on $\prod_{n\in\Bbb N}X_n$ by $(x,y)\in E((X_n,\psi_n)_{n\in\Bbb N})\Leftrightarrow\sum_{n\in\Bbb…

Let $(X_n)$ be a sequence of random variables with values in a standard Borel space $S$. We investigate the condition \begin{gather}\label{x56w1q} E\bigl\{f(X_{n+1})\mid X_1,\ldots,X_n\bigr\}\,\quad\text{converges in probability,}\tag{*}…

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…

In this paper, a notion of Schauder equivalence relation $\mathbb R^\mathbb N/L$ is introduced, where $L$ is a linear subspace of $\mathbb R^\mathbb N$ and the unit vectors form a Schauder basis of $L$. The main theorem is to show that the…

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

We show that the uniform measure-theoretic ergodic decomposition of a countable Borel equivalence relation $(X, E)$ may be realized as the topological ergodic decomposition of a continuous action of a countable group $\Gamma…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

We extend anti-classification results in ergodic theory to the collection of weakly mixing systems by proving that the isomorphism relation as well as the Kakutani equivalence relation of weakly mixing invertible measure-preserving…

We prove an analogue of the Borel-Bott-Weil theorem in equivariant KK-theory by constructing certain canonical equivariant correspondences between minimal flag varieties G/B, with G a complex semisimple Lie group.

We are dealing with the complexity of the homeomorphism equivalence relation on some classes of metrizable compacta from the viewpoint of invariant descriptive set theory. We prove that the homeomorphism equivalence relation of absolute…

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…

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

We prove that given any $\beta<1/3$, a time interval $[0,T]$, and given any smooth energy profile $e \colon [0,T] \to (0,\infty)$, there exists a weak solution $v$ of the three-dimensional Euler equations such that $v \in…

Given a non-cyclic simple dimension group D and a subgroup E of Q/Z, we produce a minimal \'etale equivalence relation R such that H_0(\R) is isomorphic to D \oplus E, where H_0(R) denotes the zeroth homology group of R. The equivalence…

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…

A linear relation $E$ acting on a Hilbert space is idempotent if $E^2=E.$ A triplet of subspaces is needed to characterize a given idempotent: $(\mathrm{ran} \, E, \mathrm{ran}(I-E), \mathrm{dom}\, E),$ or equivalently, $(\mathrm{ker}(I-E),…

Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…

A subvariety V of an abelian variety is `translate' if it is the union of translates of proper algebraic subgroups. An irreducible V is `transverse' if it is not contained in any translate variety. Effective sharp lower bounds for a…