Recently Murlak and one of the authors have shown that the family of trees recognized by weak alternating automata (or equivalently, the family of tree models of the alternation free fragment of the modal μcalculus) is closed under three set theoretic operations that corresponds to sum, multiplication by ordinals < ωω and pseudo exponentiation with the base ω1 of the Wadge degree. Moreover they...

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire sp...

A series of informal seminars at graduate-student level on the subject of coupling dependence in quantum field theory, with an elementary introduction to the notion of resurgent function that forms the appropriate framework for the coupling dependence of strictly renormalizable theories. While most of the discussion is pedagogical, there are also a few things for the expert: we demonstrate, by ...

Extending work of Hochman, we study the almost-Borel structure, i.e., the nonatomic invariant probability measures, of symbolic systems and surface diffeomorphisms. We first classify Markov shifts and characterize them as strictly universal with respect to a natural family of classes of Borel systems. We then study their continuous factors showing that a low entropy part is almost-Borel isomorp...

Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that covers all of X. Here a set of vertices of a graph G is independent if no two vertices in the set are connected by an edge. We show that it is consistent with an arbitrarily large size of the continuum that every closed ...

We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N, although its Borel chromatic number is א0. We also show that if add(null) = c, then the universally measurable chromatic number of every treei...