English
Related papers

Related papers: On the complexity of Borel equivalence relations w…

200 papers

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…

Logic · Mathematics 2022-06-24 Uri Andrews , Daniel Belin , Luca San Mauro

The dimension algebra of graded groups is introduced. With the help of known geometric results of extension theory that algebra induces all known results of the cohomological dimension theory. Elements of the algebra are equivalence classes…

Algebraic Topology · Mathematics 2008-02-27 Jerzy Dydak

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

Logic · Mathematics 2012-09-19 Tapani Hyttinen , Vadim Kulikov

We show that if $\mathcal{F}$ is any "well-behaved" subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $\pow(\mathbb{R})$ induced by $\mathcal{F}$ turns out to look like the Wadge hierarchy…

Logic · Mathematics 2010-03-25 Luca Motto Ros

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

Logic · Mathematics 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

We study the Borel-reducibility of isomorphism relations in the generalized Baire space $\kappa^\kappa$. In the main result we show for inaccessible $\kappa$, that if $T$ is a classifiable theory and $T'$ is superstable with the strong…

Logic · Mathematics 2021-09-29 Miguel Moreno

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

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…

Logic · Mathematics 2023-11-09 Nikolay Bazhenov , Keng Meng Ng , Luca San Mauro , Andrea Sorbi

Let $\pi: Y\rightarrow X$ be a continuous surjection between compact Hausdorff spaces $Y$ and $X$ which is irreducible in the sense that if $F\subsetneq Y$ is closed, then $\pi(F)\neq X$. We exhibit isomorphisms between various Boolean…

General Topology · Mathematics 2025-06-11 David R. Pitts

We investigate some basic descriptive set theory for countably based completely quasi-metrizable topological spaces, which we refer to as quasi-Polish spaces. These spaces naturally generalize much of the classical descriptive set theory of…

Logic · Mathematics 2012-11-07 Matthew de Brecht

There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…

Logic · Mathematics 2020-01-20 Andrew Marks , Theodore Slaman , John Steel

We present and thoroughly study natural Polish spaces of separable Banach spaces. These spaces are defined as spaces of norms, resp. pseudonorms, on the countable infinite-dimensional rational vector space. We provide an exhaustive…

Functional Analysis · Mathematics 2022-05-27 Marek Cúth , Martin Doležal , Michal Doucha , Ondřej Kurka

In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good…

Logic · Mathematics 2024-11-20 Luca Motto Ros

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic…

Logic · Mathematics 2019-08-16 Samuel Coskey , Roman Kossak

In the late $70$'s Feldman and Moore defined the cohomology associated to a countable equivalence relation with coefficients in an Abelian Polish group. When the equivalence relation is the orbital one, that is it is induced by a measure…

Dynamical Systems · Mathematics 2022-09-20 Alessio Savini

A Banach space has the Schur property when every weakly convergent sequence converges in norm. We prove a Schur-like property for measures: if a sequence of finite signed Borel measures on a Polish space is such that it is bounded in total…

Functional Analysis · Mathematics 2018-12-18 Sander C. Hille , Tomasz Szarek , Daniel T. H. Worm , Maria Ziemlanska

We show that for fields that are of characteristic 0 or algebraically closed of characteristic greater than 5, that certain classes of Leibniz algebras are 2-recognizeable. These classes are solvable, strongly solvable and super solvable.…

Rings and Algebras · Mathematics 2015-04-20 Tiffany Burch , Meredith Harris , Allison McAlister , Elyse Rogers , Ernie Stitzinger , S. McKay Sullivan

An analogue of Serre's theorem is established for finite dimensional simple Lie superalgebras, which describes presentations in terms of Chevalley generators and Serre type relations relative to all possible choices of Borel subalgebras.…

Representation Theory · Mathematics 2011-01-18 R. B. Zhang

Given a metrizable space $X$, let $AM(X)$ be the space of continuous bounded admissible metrics on $X$, which is endowed with the sup-metric. In this paper, we shall investigate the Borel complexity and the complete metrizability of $AM(X)$…

General Topology · Mathematics 2024-04-09 Katsuhisa Koshino

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Logic · Mathematics 2013-05-14 Luca Motto Ros
‹ Prev 1 8 9 10 Next ›