Can partial indexings be totalized?

Journal of Symbolic Logic 66 (3):1157-1185 (2001)
  Copy   BIBTEX

Abstract

In examples like the total recursive functions or the computable real numbers the canonical indexings are only partial maps. It is even impossible in these cases to find an equivalent total numbering. We consider effectively given topological T 0 -spaces and study the problem in which cases the canonical numberings of such spaces can be totalized, i.e., have an equivalent total indexing. Moreover, we show under very natural assumptions that such spaces can effectively and effectively homeomorphically be embedded into a totally indexed algebraic partial order that is closed under the operation of taking least upper bounds of enumerable directed subsets

Other Versions

No versions found

Similar books and articles

A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
Effective inseparability in a topological setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
Extremal numberings and fixed point theorems.Marat Faizrahmanov - 2022 - Mathematical Logic Quarterly 68 (4):398-408.
Constructive order types on cuts.Robert I. Soare - 1969 - Journal of Symbolic Logic 34 (2):285-289.
On effective topological spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.

Analytics

Added to PP
2009-01-28

Downloads
338 (#134,567)

6 months
30 (#299,398)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
An isomorphism theorem for partial numberings.Dieter Spreen - 2014 - In Vasco Brattka, Hannes Diener & Dieter Spreen, Logic, Computation, Hierarchies. Berlin, Boston: De Gruyter. pp. 341-382.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
Theorie der Numerierungen II.J. U. L. Eršov - 1975 - Mathematical Logic Quarterly 21 (1):473-584.

View all 14 references / Add more references