paper

The complexity of some ordinal determined classes of operators

arXiv:1905.10663

Abstract

We compute the complexity of the classes of operators and in the coding of operators between separable Banach spaces. We also prove the non-existence of universal factoring operators for both and . The latter result is an ordinal extension of a result of Johnson and Girardi.