Partial orderings for sets of multisets (Q1821780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3999926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial orderings for sets of multisets |
scientific article; zbMATH DE number 3999926 |
Statements
Partial orderings for sets of multisets (English)
0 references
1985
0 references
It is shown that if \((S,<)\), a poset, does not contain an infinite descending chain, then neither do some naturally defined posets on the set of finite sub-multisets, i.e. functions f:T\(\to N\), where T is a finite subset of S, N is the set of natural numbers. The author identifies the cases of the axiom of choice used in the proofs.
0 references
multisets
0 references
well-founded sets
0 references
axiom of choice
0 references
0.7806653380393982
0 references
0.7677841782569885
0 references
0.7323727011680603
0 references
0.7301737666130066
0 references
