A note on the computable categoricity of l^p spaces

2014/12/06 by Timothy H. McNicholl, McNicholl, Timothy H.
Computer Science · Mathematics · #03D78 (Primary) 03D45 (Secondary) #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Digital Image Processing Techniques #FOS: Mathematics #Logic (math.LO)

paper · pdf · doi:10.48550/arxiv.1412.2288

openalex publication_date 2014/12/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Suppose p is a computable real so that p ≥ 1. We show that in both the real and complex case l^p is computably categorical if and only if p ≠ 2.

Related

• Analytic computable structure theory and L^p-spaces part 2
• Analytic computable structure theory and L^p spaces
• Computable copies of ℓ^p
• A project about chains of spaces, regarding topological and algebraic\n genericity and spaceability
• Computably discrete represented spaces