Coding without fine structure
From MaRDI portal
Publication:4372907
DOI10.2307/2275573zbMATH Open0891.03022arXivmath/9509208OpenAlexW2594613218MaRDI QIDQ4372907FDOQ4372907
Authors: Sy-David Friedman
Publication date: 8 July 1998
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
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".
Full work available at URL: https://arxiv.org/abs/math/9509208
Recommendations
Other aspects of forcing and Boolean-valued models (03E40) Inner models, including constructibility, ordinal definability, and core models (03E45)
Cites Work
Cited In (6)
This page was built for publication: Coding without fine structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372907)