Descriptive set theoretical complexity of randomness notions
We study the descriptive set theoretical complexity of various randomness notions.
We study the descriptive set theoretical complexity of various randomness notions.
We show that Martin’s conjecture on Π¹₁ functions uniformly -order preserving on a cone implies Π¹₁ Turing Determinacy over ZF + DC. In addition, it is also proved that for n ≥ 0, this conjecture for uniformly degree invariant functions is equivalent over ZFC to -Axiom of Determinacy. As a corollary, the consistency of the conjecture for uniformly degree invariant Π¹₁ functions implies the consistency of the existence of a Woodin cardinal.
In this paper, we limit our analysis to the difference of the weighted composition operators acting from the Hardy space to weighted-type space in the unit ball of , and give some necessary and sufficient conditions for their boundedness or compactness. The results generalize the corresponding results on the single weighted composition operators and on the differences of composition operators, for example, M. Lindström and E. Wolf: Essential norm of the difference of weighted composition operators....
This paper characterizes the boundedness and compactness of weighted composition operators between a weighted-type space and the Hardy space on the unit ball of ℂⁿ.
Let H() denote the space of all holomorphic functions on the unit ball ⊂ ℂⁿ. Let φ be a holomorphic self-map of and u∈ H(). The weighted composition operator on H() is defined by . We investigate the boundedness and compactness of induced by u and φ acting from Zygmund spaces to Bloch (or little Bloch) spaces in the unit ball.
Page 1