Total Representations
From MaRDI portal
Publication:4927427
DOI10.2168/LMCS-9(2:5)2013zbMATH Open1285.03064arXiv1304.1239OpenAlexW3037699939MaRDI QIDQ4927427
Publication date: 20 June 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Abstract: Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and representations closer, unify some terminology, simplify some technical details, suggest interesting open questions and new invariants of topological spaces relevant to computable analysis.
Full work available at URL: https://arxiv.org/abs/1304.1239
Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78) Hierarchies of computability and definability (03D55)
Related Items (12)
Representation for multiple right-hand sides ⋮ Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces ⋮ A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES ⋮ Effective wadge hierarchy in computable quasi-Polish spaces ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Towards a descriptive theory of cb0-spaces ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Representing Wholes by Structure ⋮ Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces ⋮ Precomplete numberings ⋮ Boole vs Wadge: comparing two basic tools of descriptive set theory
This page was built for publication: Total Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4927427)
