A simpler proof of Jensen's coding theorem
Sy D. Friedman
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.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf