math.LO — Logic
Contributed by Elliot Glazer
We study ordinal-definable families of sets of arbitrary rank in
Cohen, random, and collapse extensions. Over L, 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 κ is singular strong
limit and has uncountable cofinality, adding κ Cohen reals makes
every member of a short-parameter definable family of size at most
κ definable from a short parameter. Adding κ random reals
gives a single short-parameter definable enumeration for every such
family of size strictly below κ. 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 2c classes modulo null sets consists of measurable
sets; the corresponding category assertion also holds.
In the extensions of L by ω1 Cohen or random reals, no
model of IΔ0 of size at most ℵ1, definable from
ordinals and a real, has full binary-coded standard system.
Π11-CA0 proves a finite-fragment Borel obstruction
to a full binary standard system for IΔ0. For
regular uncountable κ, the generalized Cohen extension by
$\Add(\kappa,\Lambda)^L$, Λ>κ, has no ambiently
κ+-saturated IΔ0 model in
HODHκ+, regardless of its size.
Consequently every infinite regular κ of L admits a
cofinality-preserving GCH extension with no
ODP(κ)
saturated arithmetic presentation of size κ+. ZFC also proves that every singular strong limit κ admits
an OD κ+-saturated elementary extension of N of
size 2κ, hence of size κ+ under GCH.
Primarily AI-generated textHuman understanding: some partsBoolean algebrasSet theorydefinability