{"paper":{"title":"Embeddings of Iteration Trees","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"William Mitchell","submitted_at":"1992-04-17T00:00:00Z","abstract_excerpt":"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.\n  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.\n  In the final section (which is most of the paper) I sketch a proof that any tree iteration can be embedded into a normal iteratio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9204209","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}