Borel ideals vs. Borel sets of countable relations and trees (Q1120573)

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 4101183
Language Label Description Also known as
default for all languages
No label defined
    English
    Borel ideals vs. Borel sets of countable relations and trees
    scientific article; zbMATH DE number 4101183

      Statements

      Borel ideals vs. Borel sets of countable relations and trees (English)
      0 references
      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

      Identifiers