We prove that if f is a partial Borel function from one Polish space to another, then either f can be decomposed into countably many partial continuous functions, or else f contains the countable infinite power of a bijection that maps a convergent sequence together with its limit onto a discrete space. This is a generalization of a dichotomy discovered by Solecki for Baire class 1 functions. As an application, we provide a characterization of functions which are countable unions of (...) continuous functions with domains of type Πn0, for a fixed n<ω. For Baire class 1 functions, this generalizes analogous characterizations proved by Jayne and Rogers for n=1 and Semmes for n=2. (shrink)

With every σ-ideal I on a Polish space we associate the σ-ideal I* generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals I and I* and find connections between their forcing properties. To this end, we associate to a σ-ideal on a Polish space an ideal on a countable set and show how forcing properties of the forcing depend on combinatorial properties of the ideal. We also study the 1—1 or (...) constant property of σ-ideals, i.e., the property that every Borel function defined on a Borel positive set can be restricted to a positive Borel set on which it either 1—1 or constant. We prove the following dichotomy: if I is a σ-ideal generated by closed sets, then either the forcing P I adds a Cohen real, or else I has the 1—1 or constant property. (shrink)

The authors investigate an operation * on the subsets of ${\mathcal{P}(\mathbb{R})}$ . It is connected with Borel’s strong measure zero sets as well as strongly meager. The results concern the behaviour of the family of countable sets when * is applied.

The Steprāns forcing notion arises as quotient of the algebra of Borel sets modulo the ideal of σ-continuity of a certain Borel not σ-continuous function. We give a characterization of this forcing in the language of trees and use this characterization to establish such properties of the forcing as fusion and continuous reading of names. Although the latter property is usually implied by the fact that the associated ideal is generated by closed sets, we show that it is not the (...) case with Steprāns forcing. We also establish a connection between Steprāns forcing and Miller forcing thus giving a new description of the latter. Eventually, we exhibit a variety of forcing notions which do not have continuous reading of names in any presentation. (shrink)