Forcing in admissible sets (Q1191174)

An admissible set is constructed by forcing. Using this set, the author proves that a countable admissible set \(\mathbb{A}\) has no non-trivial admissible end-extension with the same urelements and ordinals iff \(\mathbb{A}=\text{HF}(X)\) for a finite \(X\).