ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1017/jsl.2020.63 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1906.12209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets of computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banach spaces of vector-valued functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index sets in computable analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic computable structure theory and $L^p$ spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively categorical abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for torsion-free abelian groups is analytic complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable completely decomposable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Friedberg enumeration of equivalence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hierarchy of sets. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5609457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5673086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3130249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding bases of uncountable free abelian groups is usually difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform convexity of \(L^p\) and \(l^p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the isometries of certain function-spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable copies of ℓ p 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous logic and embeddings of Lebesgue spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the exponent of a Lebesgue space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isometry degree of a computable copy of ℓ p 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable topological groups and Pontryagin duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE POLISH GROUP ACTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computably Isometric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and operations on the space of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Classification Problem for Compact Computable Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Algebra, General Theory and Theory of Computable Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decomposability problem for torsion-free abelian groups is analytic-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/JSL.2020.63 / rank
 
Normal rank

Latest revision as of 17:37, 30 December 2024

scientific article; zbMATH DE number 7326441
Language Label Description Also known as
English
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
scientific article; zbMATH DE number 7326441

    Statements

    ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2021
    0 references
    computable analysis
    0 references
    computable structure theory
    0 references
    \(L^p\) spaces
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references