arXiv (All)
open access
Effective bases and notions of effective second countability in computable analysis
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a robust notion of computably second countable represented sp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Computable Bases#1012069
- Finite Spectra of Syllogistic Logic with Cardinality Comparisons#1051299
- Logicism, Interpretability, and Knowledge of Arithmetic#776229
- ¿ES NECESARIO ESTAR ALFABETIZADO PARA COMPRENDER QUÉ SIGNIFICA CONTAR Y QUE LOS NÚMEROS NATURALES SON INFINITOS?#114258
- Cardinality and autoscaling: Revisiting the content and format of the approximate number system#105433
Record · ID 1012057
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive