A simpler proof of Jensen's coding theorem

DOI10.1016/0168-0072(94)90067-1zbMath0809.03040arXivmath/9211204OpenAlexW2592414520MaRDI QIDQ1338196

Sy-David Friedman

Publication date: 27 November 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9211204

zbMATH Keywords

class forcingJensen's coding theoremlimit codingsuccessor coding

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Other aspects of forcing and Boolean-valued models (03E40)

Related Items

Coding without fine structure, Projective Measure Without Projective Baire

Cites Work

• Strong coding
• Jensen's Σ* theory and the combinatorial content of V = L
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item