Coding Without Fine Structure
Logic
2016-09-06 v1
Abstract
We present a proof of Jensen's Coding Theorem (assumong -0#) which quotes the covering lemma, but otherwise makes no appeal to fine structure theory. The key idea is to use a modified definition of the coding at limit cardinals, using "coding delays".
Cite
@article{arxiv.math/9509208,
title = {Coding Without Fine Structure},
author = {Sy D. Friedman},
journal= {arXiv preprint arXiv:math/9509208},
year = {2016}
}