A combinatorial forcing for coding the universe by a real when there are no sharps

DOI10.2307/2275507zbMath0819.03039arXivmath/9311204OpenAlexW2148334740MaRDI 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

zbMATH Keywords

forcingdecodinggamecovering lemmacombinatorial approach to Jensen's method of coding by a realcombinatorial consequences of fine structure

Mathematics Subject Classification ID

Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items (2)

Properness Without Elementaricity ⋮ Projective Measure Without Projective Baire

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

This page was built for publication: A combinatorial forcing for coding the universe by a real when there are no sharps