Borel computation of names in template iterations
Abstract
We prove that, for a suitable iteration along a template, we can compute any name for a real from a Borel function coded in the ground model evaluated at only countably many of the generic reals.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.