Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T11:52:20.332Z Has data issue: false hasContentIssue false

ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

Published online by Cambridge University Press:  26 October 2020

TYLER A. BROWN
Affiliation:
DEPARTMENT OF MATHEMATICS IOWA STATE UNIVERSITY AMES, IOWA 50011, USADIVISION OF HEALTH, MATHEMATICS, AND SCIENCES COLUMBIA COLLEGE COLUMBIA, SOUTH CAROLINA 29203, USA E-mail: tbrown@columbiasc.edu
TIMOTHY H. MCNICHOLL
Affiliation:
DEPARTMENT OF MATHEMATICS IOWA STATE UNIVERSITY AMES, IOWA 50011, USA E-mail: mcnichol@iastate.edu
ALEXANDER G. MELNIKOV
Affiliation:
THE INSTITUTE OF NATURAL AND MATHEMATICAL SCIENCES PRIVATE BAG 102 904 NSMC ALBANY 0745, AUCKLAND, NEW ZEALAND E-mail: alexander.g.melnikov@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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

Information

Type
Articles
Copyright
© The Association for Symbolic Logic 2020