English
Related papers

Related papers: A weak dichotomy below E_1 \times E_3

200 papers

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

Logic · Mathematics 2025-05-13 Michael Wolman

We discuss combinatorial conditions for the existence of various types of reductions between equivalence relations, and in particular identify necessary and sufficient conditions for the existence of injective reductions.

Logic · Mathematics 2014-10-29 Dan Hathaway , Scott Schneider

Namely, we prove that if $G$ is a countable, discrete group and $f\in M_{n}(\Z(G))$ is invertible on $\ell^{2}(G)^{\oplus n},$ but $f$ is not invertible in $M_{n}(\Z(G))$, then the measure-preserving action of $G$ on $X_{f}$ equipped with…

Dynamical Systems · Mathematics 2017-12-22 Ben Hayes

We prove that if every real belongs to a set generic extension of the constructible universe then every \Sigma_1^1 equivalence E on reals either admits a Delta_1^HC reduction to the equality on the set 2^{<\om_1} of all countable binary…

Logic · Mathematics 2018-08-22 Vladimir Kanovei

We introduce a notion of quasi-weak equivalences associated with weak-equivalences in an exact category. It gives us a delooping for (idempotent complete) exact categories and a condition that the negative $K$-group of an exact category…

K-Theory and Homology · Mathematics 2010-09-24 Toshiro Hiranouchi , Satoshi Mochizuki

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 stable with OCP, then the…

Logic · Mathematics 2015-09-18 Tapani Hyttinen , Miguel Moreno

Standard results in descriptive set theory provide sufficient conditions for a Borel set $P \subseteq \mathbb{N}^\mathbb{N} \times \mathbb{N}^\mathbb{N}$ to admit a Borel uniformization, namely, when $P$ has "small" sections or "large"…

Logic · Mathematics 2025-08-26 Alexander S. Kechris , Michael Wolman

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

Logic · Mathematics 2018-02-12 Russell Miller , Keng Meng Ng

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

Logic in Computer Science · Computer Science 2011-02-02 Wil Dekkers

A system of quasilinear elliptic equations on an unbounded domain is considered. The existence of a sequence of radially symmetric weak solutions is proved via variational methods.

Analysis of PDEs · Mathematics 2020-06-11 M. A. Ragusa , A. Razani

We investigate weak recognizability of deterministic languages of infinite trees. We prove that for deterministic languages the Borel hierarchy and the weak index hierarchy coincide. Furthermore, we propose a procedure computing for a…

Information Theory · Computer Science 2008-02-21 Filip Murlak

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

Logic · Mathematics 2010-12-07 Su Gao , Peter Gerdes

The Solecki dichotomy in descriptive set theory and the Posner-Robinson theorem in computability theory bear a superficial resemblance to each other and can sometimes be used to prove the same results, but do not have any obvious direct…

Logic · Mathematics 2023-01-19 Patrick Lutz

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…

Logic · Mathematics 2015-10-19 Richard Rast , Davender Singh Sahota

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

Category Theory · Mathematics 2012-05-25 Stephen Lack , Jiri Rosicky

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…

Logic · Mathematics 2025-12-30 Tyler Arant , Alexander S. Kechris , Patrick Lutz

We establish a consistency result by comparing two independent notions of generalised solutions to a large class of linear hyperbolic first order PDE systems with constant coefficients, showing that they eventually coincide. The first is…

Analysis of PDEs · Mathematics 2018-01-25 Nikos Katzourakis

We consider the gravitational correction to the running of gauge coupling. Weak gravity conjecture implies that the gauge theories break down when the gravitational correction becomes greater than the contribution from gauge theories. This…

High Energy Physics - Theory · Physics 2010-10-27 Qing-Guo Huang

We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…

Mathematical Physics · Physics 2013-03-26 Zhuo Chen , Mathieu Stienon , Ping Xu

We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…

Category Theory · Mathematics 2022-01-31 John Bourke
‹ Prev 1 3 4 5 6 7 10 Next ›