Borel ideals vs. Borel sets of countable relations and trees (Q1120573): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0168-0072(80)90003-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2079219288 / rank | |||
Normal rank |
Revision as of 01:20, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Borel ideals vs. Borel sets of countable relations and trees |
scientific article |
Statements
Borel ideals vs. Borel sets of countable relations and trees (English)
0 references
1989
0 references
For \(\mu\), a countable ordinal, let \(I_{\mu}\) be the ideal of subsets of \(\omega^{\mu}\) with order type less than \(\omega^{\mu}\). It is shown that, when appropriately coded, \(I_{\mu}\) is a \(\Sigma^ 0_{2\mu}\)-complete Borel set. This result is extended to partial orders representing small ordinals, trees with small ranks, etc. The proofs are based on Wadge games.
0 references
Borel classifications
0 references
ideal of subsets
0 references
Borel set
0 references
partial orders representing small ordinals
0 references
trees with small ranks
0 references
Wadge games
0 references