On Turing degrees of points in computable topology (Q3528143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4249723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Lattices and Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A blend of methods of recursion theory and topology. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degree-preserving homeomorphisms between trees in computable topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hierarchy and extension of monotonically computable real numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On effective topological spaces / 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

Latest revision as of 17:03, 28 June 2024

scientific article
Language Label Description Also known as
English
On Turing degrees of points in computable topology
scientific article

    Statements

    Identifiers

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