English
Related papers

Related papers: On countable cofinality of definable chains in Bor…

200 papers

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

In this paper, it is shown that the diagonal coset vertex operator algebra $C(L_{\mathfrak{g}}(k+2,0),L_{\mathfrak{g}}(k,0)\otimes L_{\mathfrak{g}}(2,0))$ is rational and $C_2$-cofinite in case $\mathfrak{g}=so(2n), n\geq 3$ and $k$ is an…

Quantum Algebra · Mathematics 2021-07-21 Xingjun Lin

First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…

Logic · Mathematics 2015-04-21 Matthias Baaz , Norbert Preining , Richard Zach

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

Logic · Mathematics 2023-11-07 Mohammad Golshani , Saharon Shelah

The concept of an omnigenous locally finite group was introduced in [2] as a generalization of Hall's universal countable locally finite group. In this paper we show that the class of all countable omnigenous locally finite groups is Borel…

Logic · Mathematics 2025-09-17 Su Gao , Feng Li

We investigate which definable separable metric spaces are countable dense homogeneous (CDH). We prove that a Borel CDH space is completely metrizable and give a complete list of zero-dimensional Borel CDH spaces. We also show that for a…

General Topology · Mathematics 2013-10-09 Michael Hrusak , Beatriz Zamora Aviles

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…

Logic in Computer Science · Computer Science 2016-07-07 Prateek Karandikar , Philippe Schnoebelen

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

Logic · Mathematics 2019-05-24 Bob A Dumas

We show that ribbon rational homology cobordism is a partial order within the class of irreducible 3-manifolds. This makes essential use of the methods recently employed by Ian Agol to show that ribbon knot concordance is a partial order.

Geometric Topology · Mathematics 2025-03-12 Stefan Friedl , Filip Misev , Raphael Zentner

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Logic · Mathematics 2017-10-18 Nathanael Ackerman , Cameron Freer , Rehana Patel

We study maximal orthogonal families of Borel probability measures on $2^\omega$ (abbreviated m.o. families) and show that there are generic extensions of the constructible universe $L$ in which each of the following holds: (1) There is a…

Logic · Mathematics 2011-06-22 Vera Fischer , Sy-David Friedman , Asger Tornquist

We give an affirmative answer to the following question: Is any Borel subset of a Cantor set $\textbf{ C}$ a sum of a countable number of pairwise disjoint $h$-homogeneous subspaces that are closed in $X$? It follows that every Borel set $X…

Logic · Mathematics 2011-02-17 Alexey Ostrovsky

We define some natural notions of strong and weak Borel Ramsey properties for countable Borel equivalence relations and show that they hold for a countable Borel equivalence relation if and only if the equivalence relation is smooth. We…

Logic · Mathematics 2025-03-28 Su Gao , Ming Xiao

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

Combinatorics · Mathematics 2012-07-19 Ivan Mitrofanov

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…

Logic · Mathematics 2010-12-16 Greg Hjorth , Ioannis Souldatos

We study the definability of maximal towers and of inextendible linearly ordered towers (ilt's), a notion that is more general than that of a maximal tower. We show that there is, in the constructible universe, a $\Pi^1_1$ definable maximal…

Logic · Mathematics 2018-11-22 V. Fischer , J. Schilhan

We show that unitary groups of II$_1$ factors and of properly infinite von Neumann algebras have strong uncountable cofinality. In particular, we obtain a short alternative proof for the strong uncountable cofinality of…

Group Theory · Mathematics 2019-12-18 Philip A. Dowerk

This is a slightly corrected version of an old work. For a cardinal $\mu$ we give a sufficient condition $\oplus_\mu$ (involving ranks measuring existence of independent sets) for: $\otimes_\mu$ if a Borel set $B\subseteq \mathbb{R} \times…

Logic · Mathematics 2023-05-03 Saharon Shelah

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

Logic · Mathematics 2014-12-31 John D. Clemens , Dominique Lecomte , Benjamin D. Miller

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa