English
Related papers

Related papers: On countable cofinality and decomposition of defin…

200 papers

We show that the Dual Borel Conjecture implies that ${\mathfrak d}> \aleph_1$ and find some topological characterizations of perfectly meager and universally meager sets.

Logic · Mathematics 2007-05-23 Tomek Bartoszynski

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Logic · Mathematics 2025-06-09 Nicolás Cuervo Ovalle , Isaac Goldbring

We show that the classical homology theory of Steenrod may be enriched with descriptive set-theoretic information. We prove that the resulting definable homology theory provides a strictly finer invariant than Steenrod homology for compact…

Algebraic Topology · Mathematics 2024-04-23 Jeffrey Bergfalk , Martino Lupini , Aristotelis Panagiotopoulos

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Logic · Mathematics 2025-05-13 Linus Richter

We prove that it is consistent that the covering of the ideal of measure zero sets has countable cofinality.

Logic · Mathematics 2016-09-07 Saharon Shelah

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…

Logic · Mathematics 2026-01-09 Masato Fujita , Tomohiro Kawakami

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

In this paper we classify countable locally finite-by-abelian groups up to coarse isomorphism. This classification is derived from a coarse classification of amenable shift-homogeneous metric spaces.

Metric Geometry · Mathematics 2014-12-16 Taras Banakh , Matija Cencelj , Dušan Repovš , Ihor Zarichnyi

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

Logic · Mathematics 2026-01-27 Gianluca Paolini , Saharon Shelah

A $\Sigma$-construction of Solovay is partially extended to the case of intermediate sets which are not necessarily subsets of the ground model. As an application, we prove that, for a given name $t$, the set of all sets $t[G]$, $G$ being…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R^{n+1},<_l), where <_l is the…

Logic · Mathematics 2010-11-09 Janak Ramakrishnan

We prove that for each partition of the Lobachevsky plane into finitely many Borel pieces one of the cells of the partition contains an unbounded centrally symmetric subset.

Combinatorics · Mathematics 2010-02-08 T. Banakh , A. Dudko , D. Repovš

We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…

Combinatorics · Mathematics 2023-06-02 Ming Xiao

Let $\xi\geq 1$ be a countable ordinal. We study the Borel subsets of the plane that can be made ${\bf\Pi}^0_\xi$ by refining the Polish topology on the real line. These sets are called potentially ${\bf\Pi}^0_\xi$. We give a Hurewicz-like…

Logic · Mathematics 2009-06-01 Dominique Lecomte

We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…

Classical Analysis and ODEs · Mathematics 2025-02-05 Antoine Detaille , Augusto C. Ponce

Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…

Logic · Mathematics 2020-10-29 Hossein Lamei Ramandi

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Group Theory · Mathematics 2025-01-15 Emmanuel Rauzy
‹ Prev 1 4 5 6 7 8 10 Next ›