Access Restriction

Author Lecomte, Dominique ♦ Zeleny, Miroslav
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Borel Rectangle ♦ Countable Union ♦ Descriptive Complexity ♦ Partial Injection ♦ Measurable Countable Coloring ♦ Closed Set ♦ Disjoint Domain
Abstract Abstract. We give, for each countable ordinal ξ≥1, an example of a ∆0 2 countable union of Borel rectangles that cannot be decomposed into countably many Π0 ξ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets, and which has no ∆0 ξ-measurable countable coloring.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2013-01-01