Related papers: Measure reducibility of countable Borel equivalenc…

The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…

We improve the known results about the complexity of the relation of isomorphism between separable Banach spaces up to Borel reducibility, and we achieve this using the classical spaces $c_0$, $\ell_p$ and $L_p$, $1 \leq p <2$. More…

We show that the isomorphism of ergodic measure-preserving transformations is not Borel reducible to the relation induced by the conjugacy action of the full group of an ergodic measure-preserving transformation on itself. This answers a…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

We prove that there exists uncountably many pairwise disjoint open subsets of the Gelfand space of the measure algebra on any locally compact non-discrete abelian group which shows that this space is not separable (in fact, we prove this…

A Borel system consists of a measurable automorphism of a standard Borel space. We consider Borel embeddings and isomorphisms between such systems modulo null sets, i.e. sets which have measure zero for every invariant probability measure.…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

This paper investigates the problem of extending measure theory to non-separable structures, from generalized descriptive set theory to a broader class of spaces beyond this framework. While various notions, such as the ideal of measure…

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

We review the notion of reducibility and we introduce and discuss the notion of orbital reducibility for autonomous ordinary differential equations of first order. The relation between (orbital) reducibility and (orbital) symmetry is…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…

In this paper we complete the attempt of H. Lefmann to show that Borel equivalence relations on the $n$-element subsets of $2^{\omega}$, that respect an order type, have a finite Ramsey basis.

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

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.

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ER s of a family which includes Polish actions of S_\infty, the group of all permutations of N, and is closed…

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…