Effective bases and notions of effective second countability in computable analysis

Cites work

A blend of methods of recursion theory and topology.
A comparison of concepts from computable analysis and effective descriptive set theory
Admissibly Represented Spaces and Qcb-Spaces
Algorithmic operators in constructive metric spaces
Beziehungen zwischen gewissen Klassen effektiv topologischer Räume
Computability of Polish spaces up to homeomorphism
Computability on quasi-Polish spaces
Computable elements and functions in effectively enumerable topological spaces
Computable separation in topology, from \(T_{0}\) to \(T_{2}\)
Computable topological groups
COMPUTABLY COMPACT METRIC SPACES
Computably discrete represented spaces
Computably regular topological spaces
Density and Baire category in recursive topology
Effective operations in a general setting
Effectivity on continuous functions in topological spaces
Elementary computable topology
Foundations for computable topology
scientific article; zbMATH DE number 3127537 (Why is no real title available?)
scientific article; zbMATH DE number 3145228 (Why is no real title available?)
scientific article; zbMATH DE number 3987247 (Why is no real title available?)
scientific article; zbMATH DE number 1969324 (Why is no real title available?)
scientific article; zbMATH DE number 1460545 (Why is no real title available?)
scientific article; zbMATH DE number 1746044 (Why is no real title available?)
scientific article; zbMATH DE number 5066359 (Why is no real title available?)
scientific article; zbMATH DE number 3326329 (Why is no real title available?)
Metric spaces in synthetic topology
Multi-representation associated to the numbering of a subbasis and formal inclusion relations
Noetherian quasi-Polish spaces
Notes on overt choice
On computable metrization
On constructive functions
On degree spectra of topological spaces
On degree-preserving homeomorphisms between trees in computable topology
On effective topological spaces
On the algebraic structure of Weihrauch degrees
On the information carried by programs about the objects they compute
On the topological aspects of the theory of represented spaces
On Turing degrees of points in computable topology
Overt choice
Point Degree Spectra of Represented Spaces
Quasi-Polish spaces
Recursive metric spaces
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Representations versus numberings: On the relationship of two computability notions
Semicomputable manifolds in computable topological spaces
Some notes on spaces of ideals and computable topology
Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem
Strong computable type
Theory of representations
Total representations
Towards computability over effectively enumerable topological spaces
Type 2 recursion theory
When series of computable functions with varying domains are computable

This page was built for publication: Effective bases and notions of effective second countability in computable analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7256014)