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

DOI10.2307/2275507MaRDI QIDQ4836041zbMATH OpenOpenAlexFDO

Authors S. 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

forcingcovering lemmagamedecodingcombinatorial approach to Jensen's method of coding by a realcombinatorial consequences of fine structure

Mathematics Subject Classification ID

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

Abstract: Assuming 0# does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself.

Recommendations

• On coding uncountable sets by reals
• On forcing without the continuum hypothesis
• scientific article; zbMATH DE number 7649968
• The combinatorics of combinatorial coding by a real
• Generalizing random real forcing for inaccessible cardinals
• The bounded proper forcing axiom and well orderings of the reals
• scientific article; zbMATH DE number 65753
• Equivalence of codes for countable sets of reals
• Forcing an \(\omega_1\)-real without adding a real
• scientific article; zbMATH DE number 2033392

Cites work

• scientific article; zbMATH DE number 3733900 (Why is no real title available?)
• scientific article; zbMATH DE number 734993 (Why is no real title available?)
• A functorial \(\pi ^ 1_ 2\) singleton
• A guide to ``Strong coding
• A guide to “Coding the universe” by Beller, Jensen, Welch
• Corrigendum to ``Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
• Minimal coding
• Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
• Some applications of Jensen's coding theorem

Cited in

(6)

• A guide to “Coding the universe” by Beller, Jensen, Welch
• Projective Measure Without Projective Baire
• Properness Without Elementaricity
• The combinatorics of combinatorial coding by a real
• scientific article; zbMATH DE number 218627 (Why is no real title available?)
• Coding without fine structure

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836041)