A simpler proof of Jensen's coding theorem
Logic
2009-09-25 v1
Abstract
We present a simplification of Jensen's proof of his Coding Theorem (even in the case where 0# exists). The proof avoids Jensen's split into cases according to whether or not 0# exists. In addition, the paper contains self-contained proofs of the necessary forms of Square and Diamond, based on an approach to fine structure using Jensen's theory.
Cite
@article{arxiv.math/9211204,
title = {A simpler proof of Jensen's coding theorem},
author = {Sy D. Friedman},
journal= {arXiv preprint arXiv:math/9211204},
year = {2009}
}