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 Logic of Emergence
David H. Wolpert, David C. Krakauer
The group of strong automorphisms of the differential field of transseries
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
Escaping and generics over ideals
Laurent Bienvenu, Noam Greenberg, Ludovic Patey et al.
Definably isometric cuboids over Hensel minimal fields
Marcelo Fortmann
A weak λ-set that is not a λ-set under p = c
Alexander V. Osipov, Anton E. Lipin
The Cone Fixing the Reals of $HODM2n(x)
Farmer Schlutzenberg, Connor Watson