Embeddings of Iteration Trees

Details Embeddings of Iteration Trees Embeddings of Iteration Trees

1992-04-17

arxiv.org/abs/math/9204209v1

Mathematics

Logic

Scientific paper

This paper, dating from May 1991, contains preliminary (and unpublishable) notes on investigations about iteration trees. They will be of interest only to the specialist. In the first two sections I define notions of support and embeddings for tree iterations, proving for example that every tree iteration is a direct limit of finite tree iterations. This is a generalization to models with extenders of basic ideas of iterated ultrapowers using only ultrapowers. In the final section (which is most of the paper) I sketch a proof that any tree iteration can be embedded into a normal iteration, that is, a tree iteration with the extenders in nondecreasing order of strength and with strictly increasing critical points.

Affiliated with

Also associated with

No associations

Rating

Embeddings of Iteration Trees 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 Embeddings of Iteration Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embeddings of Iteration Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226673