Coding and reshaping when there are no sharps

Details Coding and reshaping when there are no sharps Coding and reshaping when there are no sharps

Publishing date

1992-01-15

URL

arxiv.org/abs/math/9201249v1

Journals

Math. Sci. Res. Inst. Publ. 26 (1992), 407--416

Science

Mathematics

Field

Logic

Type

Scientific paper

Abstract

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to prove that any subset of kappa^{+ omega} can be coded into a subset, W of kappa^+ which, further, ``reshapes'' the interval [kappa, kappa^+), i.e., for all kappa < delta < kappa^+, kappa = (card delta)^{L[W cap delta]}. We sketch two applications of this result, assuming 0^sharp does not exist. First, we point out that this shows that any set can be coded by a real, via a set forcing. The second application involves a notion of abstract condensation, due to Woodin. Our methods can be used to show that for any cardinal mu, condensation for mu holds in a generic extension by a set forcing.

Affiliated with

Also associated with

No associations

Rating

Coding and reshaping when there are no sharps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coding and reshaping when there are no sharps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding and reshaping when there are no sharps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637264