Coding Without Fine Structure
classification
🧮 math.LO
keywords
codingfinestructureappealassumongcardinalscoveringdefinition
read the original 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".
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.