David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Bulletin of Symbolic Logic 9 (3):299-334 (2003)
We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. Our main computability concepts are based on numerations and include those of effective metric partial algebras and effective partial homomorphisms. We prove a general equivalence theorem that includes a version of the Pour-El and Richards Theorem, and has other applications. Finally, the Pour-El and Richards axioms for computable sequence structures on Banach spaces are generalised to computable partial sequence structures on metric algebras, and we prove their equivalence with our computability model based on numerations
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Erik Palmgren & Steven J. Vickers (2007). Partial Horn Logic and Cartesian Categories. Annals of Pure and Applied Logic 145 (3):314-353.
Jens Blanck, Viggo Stoltenberg‐Hansen & John V. Tucker (2011). Stability of Representations of Effective Partial Algebras. Mathematical Logic Quarterly 57 (2):217-231.
Similar books and articles
Giangiacomo Gerla (1989). Turing L -Machines and Recursive Computability for L -Maps. Studia Logica 48 (2):179 - 192.
Janusz Czelakowski (1979). Partial Boolean Algebras in a Broader Sense. Studia Logica 38 (1):1 - 16.
Branden Fitelson (2003). Review of I. Hacking, An Introduction to Probability and Inductive Logic. [REVIEW] Bulletin of Symbolic Logic 9 (4):5006-5008.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
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.
Ingemarie Bethke (1987). On the Existence of Extensional Partial Combinatory Algebras. Journal of Symbolic Logic 52 (3):819-833.
Guram Bezhanishvili & Nick Bezhanishvili (2011). An Algebraic Approach to Canonical Formulas: Modal Case. Studia Logica 99 (1-3):93-125.
Peter Burmeister (2004). Algebraic Theory of Quasivarieties of Heterogeneous Partial Algebras. Studia Logica 78 (1-2):129 - 153.
Leon Henkin (1971). Cylindric Algebras. Amsterdam,North-Holland Pub. Co..
Added to index2009-01-28
Total downloads10 ( #137,337 of 1,096,298 )
Recent downloads (6 months)7 ( #26,118 of 1,096,298 )
How can I increase my downloads?