Each family of subsets of the urelements generates an admissible set (Q751652)
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: Publication:751652 |
scientific article; zbMATH DE number 4177042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Each family of subsets of the urelements generates an admissible set |
scientific article; zbMATH DE number 4177042 |
Statements
Each family of subsets of the urelements generates an admissible set (English)
0 references
1989
0 references
The author proves that, for any family S of subsets of the class of all urelements of an admissible set, there is a smallest admissible set generated by S. It confirms the hypothesis posed by the author [Algebra Logika 26, No.5, 577-596 (1987; Zbl 0648.03027)] and generalizes Theorem 1 from the cited paper.
0 references
\(\Sigma \) -extension
0 references
recursively saturated extension
0 references
urelements
0 references
admissible set
0 references
0.7360444664955139
0 references
0.7047181725502014
0 references
