Searcharxiv⌕ Search

arXiv · 2611.12848

Adding unbounded and not bounded sets to a singular cardinal

Abstract

This paper solves a problem (SP) attributed to Solovay in the 1960s, which is to add an unbounded sequence to a singular cardinal $κ$ without adding bounded subsets to $κ$, while preserving $κ^+$. The solution applies to any cofinality of the singular cardinal, with the assumption that $κ$ is a strong limit needed for the case of uncountable cofinality. Unsuccessful attempts to solve (SP), mostly for the countable cofinality, have appeared in published papers by various authors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirna Džamonja, Vladimir Kanovei. 2026-11-13. Adding unbounded and not bounded sets to a singular cardinal. https://searcharxiv.com/abs/2611.12848

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗