Effectivizing Lusin’s Theorem (Q5870345): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic computability, Turing degrees, and asymptotic density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the “almost all” theory of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Revision as of 06:06, 31 July 2024

scientific article; zbMATH DE number 7639629
Language Label Description Also known as
English
Effectivizing Lusin’s Theorem
scientific article; zbMATH DE number 7639629

    Statements

    Effectivizing Lusin’s Theorem (English)
    0 references
    9 January 2023
    0 references
    computability
    0 references
    computable analysis
    0 references
    Lusin's Theorem
    0 references
    0 references

    Identifiers

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