Matching works

2 works

math.LO — Logic

Ramsey’s Theorem for Pairs in Pincus’s Model XI

Contributed by Frank Gilson

Howard and Rubin record Pincus’s ordered colored permutation model as N48, but do not determine whether Ramsey’s theorem for pairs holds there. We prove that N48 |= RT for pairs. The proof uses least finite supports and the homogeneity of Pincus’s ordered colored structure: after fixing all but one point of a support, the remaining point generates an infinite orbit whose unordered pairs form a single stabilizer orbit. Combining this with Pincus’s results on the dense linear ordering principle (DO), the Boolean Prime Ideal Theorem (BPI), and the failure of Part∞, together with Pincus’s transfer theorems, yields Con(ZF) ⇒ Con(ZF + RT_pairs + DO + BPI + ¬Part∞), where Part∞ states that every infinite set is the disjoint union of infinitely many infinite sets.

A mix of human-written and AI-generated textHuman understanding: some partsaxiom of choice; Ramsey's theorem
Oct 22, 20264 pages
PDFView work

math.LO — Logic

Ordinal-definable families in Cohen, random, and collapse extensions

Contributed by Elliot Glazer

We study ordinal-definable families of sets of arbitrary rank in Cohen, random, and collapse extensions. Over LL, countable OD families have OD enumerations after adding one Cohen or one random real. A single generalized Cohen subset gives the corresponding sharp theorem at every regular uncountable cardinal. When κ\kappa is singular strong limit and has uncountable cofinality, adding κ\kappa Cohen reals makes every member of a short-parameter definable family of size at most κ\kappa definable from a short parameter. Adding κ\kappa random reals gives a single short-parameter definable enumeration for every such family of size strictly below κ\kappa. The random bound is sharp. The proofs use coordinate amalgamation and small-index arguments. We also obtain arbitrary-rank descent for countable families after collapsing any infinite cardinal, with applications to choice in the relative Feferman--Levy model. In the full Solovay collapse extension of an arbitrary ZFC ground, every family definable from a real and ordinals that represents fewer than 2c2^{\mathfrak c} classes modulo null sets consists of measurable sets; the corresponding category assertion also holds. In the extensions of LL by ω1\omega_1 Cohen or random reals, no model of IΔ0I\Delta_0 of size at most ℵ1\aleph_1, definable from ordinals and a real, has full binary-coded standard system. Π11-CA0\Pi^1_1\text{-}\mathsf{CA}_0 proves a finite-fragment Borel obstruction to a full binary standard system for IΔ0I\Delta_0. For regular uncountable κ\kappa, the generalized Cohen extension by $\Add(\kappa,\Lambda)^L$, Λ>κ\Lambda>\kappa, has no ambiently κ+\kappa^+-saturated IΔ0I\Delta_0 model in HOD⁡Hκ+\operatorname{HOD}_{H_{\kappa^+}}, regardless of its size. Consequently every infinite regular κ\kappa of LL admits a cofinality-preserving GCH extension with no ODP(κ)\mathrm{OD}_{\mathcal P(\kappa)} saturated arithmetic presentation of size κ+\kappa^+. ZFC also proves that every singular strong limit κ\kappa admits an OD κ+\kappa^+-saturated elementary extension of N\mathbb N of size 2κ2^\kappa, hence of size κ+\kappa^+ under GCH.

Primarily AI-generated textHuman understanding: some partsBoolean algebrasSet theorydefinability
Sep 30, 2026119 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations