Effective descriptive set theory refines classical descriptive set theory by emphasising computability and algorithmic aspects in the study of definable sets and functions, particularly within Polish ...
In this paper we show that Cπ(X), the set of continuous, real-valued functions on X topologized by the pointwise convergence topology, can have arbitrarily high Borel or projective complexity in RX ...
We investigate the uniform homeomorphism relation between separable Banach spaces and the related relation of local equivalence. We completely characterize the descriptive complexity of local ...
My past research has existed in the intersection of logic and descriptive set theory with computational complexity theory. Particular topics relevant to this research have centered around oracle ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results