Total Representations

Victor Selivanov

doi:10.2168/LMCS-9(2:5)2013

Victor Selivanov - Total Representations

lmcs:1191 - Logical Methods in Computer Science, June 2, 2013, Volume 9, Issue 2 - https://doi.org/10.2168/LMCS-9(2:5)2013

Total RepresentationsArticle

Authors: Victor Selivanov

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.

Comment: 30 pages

https://doi.org/10.2168/LMCS-9(2:5)2013

Source: arXiv.org:1304.1239

Volume: Volume 9, Issue 2

Secondary volumes: Selected Papers of the 8th Conference on Computability and Complexity in Analysis (CCA 2011)

Published on: June 2, 2013

Imported on: May 29, 2011

Keywords: Computer Science - Logic in Computer Science, Mathematics - Logic

Licence: arXiv.org - Non-exclusive license to distribute

Funding:

Source : OpenAIRE Graph

Computable Analysis; Funder: European Commission; Code: 294962

Classifications

Mathematics Subject Classification 2020¹

Sources:

[1] zbMATH Open.

Bibliographic References

15 Documents citing this article

Victor Selivanov, 2022, Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory, Lecture notes in computer science, pp. 287-298, 10.1007/978-3-031-08740-0_24.

Victor Selivanov, 2022, Descriptive complexity of qcb0-spaces, Theoretical Computer Science, 945, pp. 113666, 10.1016/j.tcs.2022.12.016.

Callard, Antonin;Hoyrup, Mathieu, 2020, Descriptive Complexity on Non-Polish Spaces, DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 10.4230/lipics.stacs.2020.8, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.8.

VICTOR SELIVANOV, 2020, A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES, arXiv (Cornell University), 87, 2, pp. 732-757, 10.1017/jsl.2020.52, http://arxiv.org/abs/1911.02758.

Victor Selivanov, 2020, Well-Quasi Orders and Hierarchy Theory, Trends in logic, pp. 271-319, 10.1007/978-3-030-30229-0_10.

Takayuki Kihara;Arno Pauly, 2019, Finite Choice, Convex Choice and Sorting, Lecture notes in computer science, pp. 378-393, 10.1007/978-3-030-14812-6_23.

Oleg Kudinov;Victor Selivanov, 2017, First Order Theories of Some Lattices of Open Sets, Logical Methods in Computer Science, Volume 13, Issue 3, 10.23638/lmcs-13(3:16)2017, https://doi.org/10.23638/lmcs-13(3:16)2017.

Matthew de Brecht;Matthias Schröder;Victor Selivanov, 2016, Base-complexity classifications of qcb0-spaces1, Computability, 5, 1, pp. 75-102, 10.3233/com-150044.

VASSILIOS GREGORIADES;TAMÁS KISPÉTER;ARNO PAULY, 2016, A comparison of concepts from computable analysis and effective descriptive set theory, arXiv (Cornell University), 27, 8, pp. 1414-1436, 10.1017/s0960129516000128, http://arxiv.org/abs/1403.7997.

VICTOR SELIVANOV, 2016, Towards a descriptive theory of cb0-spaces, Mathematical Structures in Computer Science, 27, 8, pp. 1553-1580, 10.1017/s0960129516000177.

Arno Pauly;Matthew De Brecht, 2015, Descriptive Set Theory in the Category of Represented Spaces, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp. 438-449, 10.1109/lics.2015.48.

Matthew de Brecht;Matthias Schröder;Victor Selivanov, 2015, Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces, Lecture notes in computer science, pp. 156-166, 10.1007/978-3-319-20028-6_16.

LUCA MOTTO ROS;PHILIPP SCHLICHT;VICTOR SELIVANOV, 2014, Wadge-like reducibilities on arbitrary quasi-Polish spaces, arXiv (Cornell University), 25, 8, pp. 1705-1754, 10.1017/s0960129513000339, http://arxiv.org/abs/1204.5338.

MATTHIAS SCHRÖDER;VICTOR SELIVANOV, 2014, Some hierarchies of QCB0-spaces, Mathematical Structures in Computer Science, 25, 8, pp. 1799-1823, 10.1017/s0960129513000376, https://doi.org/10.1017/s0960129513000376.

Matthias Schröder;Victor Selivanov, 2014, Hyperprojective Hierarchy of qcb0-Spaces, Lecture notes in computer science, pp. 352-361, 10.1007/978-3-319-08019-2_37.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 3211 times.

This article's PDF has been downloaded 492 times.