Borel ideals vs. Borel sets of countable relations and trees

DOI10.1016/0168-0072(80)90003-2zbMath0673.04001OpenAlexW2079219288MaRDI QIDQ1120573

Samy Zafrany

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(80)90003-2

zbMATH Keywords

Borel setWadge gamesideal of subsetsBorel classificationspartial orders representing small ordinalstrees with small ranks

Mathematics Subject Classification ID

Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05)

Related Items (5)

On Borel ideals ⋮ Comparison game on trace ideal ⋮ Continuum-many Boolean algebras of the form Borel ⋮ Descriptive set Theory of Families of Small Sets ⋮ On the structure of Borel ideals in-between the ideals \(\mathcal{ED}\) and fin \(\otimes\) fin in the Katětov order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptive set theory
• Chain properties in Pomega
• Zur Theorie der konstruktiven Wohlordnungen
• Recursive well-orderings
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Monotone Reducibility Over the Cantor Space
• Monotone but not positive subsets of the Cantor space
• Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy
• Invariant sets in topology and logic
• Data Types as Lattices
• Recursive well-founded orderings
• Number theoretic concepts and recursive well-orderings

This page was built for publication: Borel ideals vs. Borel sets of countable relations and trees