A combinatorial forcing for coding the universe by a real when there are no sharps
From MaRDI portal
Publication:4836041
DOI10.2307/2275507zbMath0819.03039arXivmath/9311204MaRDI QIDQ4836041
Saharon Shelah, Lee J. Stanley
Publication date: 27 August 1995
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9311204
forcing; decoding; game; covering lemma; combinatorial approach to Jensen's method of coding by a real; combinatorial consequences of fine structure
03E35: Consistency and independence results
03E45: Inner models, including constructibility, ordinal definability, and core models
03E55: Large cardinals
03E05: Other combinatorial set theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
- Corrigendum to ``Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- A guide to ``Strong coding
- Minimal coding
- A functorial \(\pi ^ 1_ 2\) singleton
- A guide to “Coding the universe” by Beller, Jensen, Welch
- Some applications of Jensen's coding theorem