ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

DOI10.1017/JSL.2020.63zbMath1482.03008arXiv1906.12209OpenAlexW3096199475MaRDI QIDQ5855756

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

Publication date: 19 March 2021

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.12209

zbMATH Keywords

computable analysis\(L^p\) spacescomputable structure theory

Mathematics Subject Classification ID

Isometric theory of Banach spaces (46B04) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items (4)

New degree spectra of Polish spaces ⋮ Generalized effective completeness for continuous logic ⋮ Computable Stone spaces ⋮ Computable analysis and classification problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the uniform convexity of \(L^p\) and \(l^p\)
• On the isometries of certain function-spaces
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Index sets in computable analysis
• Banach spaces of vector-valued functions
• Computable structures and the hyperarithmetical hierarchy
• Continuous logic and embeddings of Lebesgue spaces
• Effectively categorical abelian groups
• On a hierarchy of sets. III
• Computable structures and operations on the space of continuous functions
• Describing free groups
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• Computable completely decomposable groups
• Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete
• Index sets of computable structures
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
• COMPUTABLE POLISH GROUP ACTIONS
• A Friedberg enumeration of equivalence structures
• Computable copies of ℓ p 1
• Finding bases of uncountable free abelian groups is usually difficult
• Analytic computable structure theory and $L^p$ spaces
• Computable topological groups and Pontryagin duality
• Computing the exponent of a Lebesgue space
• The isometry degree of a computable copy of ℓ p 1
• The decomposability problem for torsion-free abelian groups is analytic-complete
• The Classification Problem for Compact Computable Metric Spaces
• CONSTRUCTIVE ALGEBRAS I
• Computably Isometric Spaces
• Computable Algebra, General Theory and Theory of Computable Fields
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES