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)|
References found in this work BETA
Theorie Der Numerierungen III.Ju L. Erš - 1977 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 23 (19-24):289-371.
Domain Representability of Metric Spaces.Jens Blanck - 1997 - Annals of Pure and Applied Logic 83 (3):225-247.
Citations of this work BETA
Partial Horn Logic and Cartesian Categories.Erik Palmgren & Steven J. Vickers - 2007 - Annals of Pure and Applied Logic 145 (3):314-353.
Stability of Representations of Effective Partial Algebras.Jens Blanck, Viggo Stoltenberg‐Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
Similar books and articles
Turing L -Machines and Recursive Computability for L -Maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
Partial Boolean Algebras in a Broader Sense.Janusz Czelakowski - 1979 - Studia Logica 38 (1):1 - 16.
Review of I. Hacking, An Introduction to Probability and Inductive Logic. [REVIEW]Branden Fitelson - 2003 - Bulletin of Symbolic Logic 9 (4):5006-5008.
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.
Computability Over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
On the Existence of Extensional Partial Combinatory Algebras.Ingemarie Bethke - 1987 - Journal of Symbolic Logic 52 (3):819-833.
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.
Added to index2009-01-28
Total downloads17 ( #273,980 of 2,146,218 )
Recent downloads (6 months)1 ( #387,123 of 2,146,218 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.