Journal of Symbolic Logic 66 (3):1157-1185 (2001)
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
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.2307/2695099 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
On Computable Numbers, with an Application to the N Tscheidungsproblem.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.
View all 15 references / Add more references
Citations of this work BETA
No citations found.
Similar books and articles
An Invariance Notion in Recursion Theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Partial Combinatory Algebras of Functions.Jaap van Oosten - 2011 - Notre Dame Journal of Formal Logic 52 (4):431-448.
Reasoning About Partial Functions with the Aid of a Computer.William M. Farmer - 1995 - Erkenntnis 43 (3):279 - 294.
An Algebraic Approach to Canonical Formulas: Modal Case.Guram Bezhanishvili & Nick Bezhanishvili - 2011 - Studia Logica 99 (1-3):93-125.
Algebraic Theory of Quasivarieties of Heterogeneous Partial Algebras.Peter Burmeister - 2004 - Studia Logica 78 (1-2):129 - 153.
Turing L -Machines and Recursive Computability for L -Maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras.Viggo Stoltenberg-Hansen & John V. Tucker - 2003 - Bulletin of Symbolic Logic 9 (3):299-334.
Analytics
Added to PP index
2009-01-28
Total views
219 ( #52,737 of 2,519,700 )
Recent downloads (6 months)
1 ( #406,314 of 2,519,700 )
2009-01-28
Total views
219 ( #52,737 of 2,519,700 )
Recent downloads (6 months)
1 ( #406,314 of 2,519,700 )
How can I increase my downloads?
Downloads