Can partial indexings be totalized?
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 | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
|
| Through your library | Configure |
Robert E. Byerly (1982). An Invariance Notion in Recursion Theory. Journal of Symbolic Logic 47 (1):48-66.
Giangiacomo Gerla (1989). Turing L -Machines and Recursive Computability for L -Maps. Studia Logica 48 (2):179 - 192.
Peter Burmeister (2004). Algebraic Theory of Quasivarieties of Heterogeneous Partial Algebras. Studia Logica 78 (1-2):129 - 153.
Guram Bezhanishvili & Nick Bezhanishvili (2011). An Algebraic Approach to Canonical Formulas: Modal Case. Studia Logica 99 (1-3):93-125.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
Jaap van Oosten (2011). Partial Combinatory Algebras of Functions. Notre Dame Journal of Formal Logic 52 (4):431-448.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Dieter Spreen (1998). On Effective Topological Spaces. Journal of Symbolic Logic 63 (1):185-221.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Viggo Stoltenberg-Hansen & John V. Tucker (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic 9 (3):299-334.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

