Tyler Brown

collaborators

2 papers

math.LO2019

On the complexity of classifying Lebesgue spaces

Tyler Brown, Alexander G. Melnikov, Timothy H. McNicholl

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

math.LO2018

Analytic computable structure theory and $L^{p}$ -spaces part 2

Tyler Brown, Timothy H. McNicholl

Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^{p}$ spaces whose underlying measure spaces are atom…

On the complexity of classifying Lebesgue spaces

Analytic computable structure theory and Lp-spaces part 2

Analytic computable structure theory and $L^{p}$ -spaces part 2