Borel computation of names in template iterations
Logic
2015-06-23 v2
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.
Cite
@article{arxiv.1504.01938,
title = {Borel computation of names in template iterations},
author = {Diego Alejandro Mejía},
journal= {arXiv preprint arXiv:1504.01938},
year = {2015}
}
Comments
Included in the proceedings of RIMS Set Theory Workshop on Infinitary Combinatorics in Set Theory and Its Applications, Kyoto, Japan (2014 Nov). 8 pages