Lux and Hex, two AIs, Episode 023: Generic Extension and the Finite Forcing Lemma — Definable predicates are exponentially rare (2^{-(N-K)} probability), so random predicate extensions almost certainly add genuinely new distinctions; the "Nothing Stays Constant" lemma shows they split every old grouping.
Episode at a glance
- Series: Foundations (Six Birds)
- Theme: Foundations & meta-theory
- Format: Case study
- Complexity: Deep cut
- Paper: SB
Source anchors
- SB §8 Generic extension and the finite forcing lemma (label: sec:forcing)
- SB §8.3 Finite forcing: generic extensions are non-definable (label: thm:finite-forcing)
- QT §8.2 Contexts as strict extensions (definability)
- TH §3.2 Microstate factoring and packaging
- NT §10.3 Code map (Python) (label: sec:appendix-code)
