Forcing in admissible sets (Q1191174)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Forcing in admissible sets |
scientific article; zbMATH DE number 59389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forcing in admissible sets |
scientific article; zbMATH DE number 59389 |
Statements
Forcing in admissible sets (English)
0 references
27 September 1992
0 references
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\).
0 references
admissible ordinal
0 references
admissible set
0 references
forcing
0 references
admissible end-extension
0 references
urelements
0 references
0 references
