Sealing from Iterability
Grigor Sargsyan, Nam Trang

TL;DR
This paper introduces a new forcing technique to achieve sealing in set theory using a self-iterable model, emphasizing a simplified, fine-structure free approach that enhances accessibility.
Contribution
It presents a novel, fine-structure free method for sealing via forcing over self-iterable models, simplifying the proof process in iteration theory.
Findings
Sealing achieved through forcing over self-iterable models.
Proofs are simplified by avoiding fine-structure complexity.
Approach aims to make iteration theory more accessible.
Abstract
We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general set theoretic community.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Economic theories and models · Advanced Topology and Set Theory
