Towards computable analysis on the generalised real line (Q2011660): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Closed choice and a uniform low basis theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Choice and Boundedness Principles in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Effective Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dedekind cuts of Archimedean complete ordered abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Candidate for the Generalised Real Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computations On Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal machines and admissible recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the topological aspects of the theory of represented spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational strengths of \(\alpha\)-tape infinite time Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 05:05, 14 July 2024

scientific article
Language Label Description Also known as
English
Towards computable analysis on the generalised real line
scientific article

    Statements

    Identifiers