Abstract
We prove that a broad class of systems of equations have endomorphisms of negative numberings as solutions. Moreover, we prove that if the endomorphisms of a numbering uniformly solve this class of systems of equations and have the separability property then the numbering is negative.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Combarro E. F., “On the endomorphisms of positive and negative numberings,” Siberian Adv. in Math., 11, No. 1, 34–44 (2001).
Ershov Yu. L., Theory of Numberings [in Russian], Nauka, Moscow (1977).
Hamilton A. G., Logic for Mathematicians, Cambridge Univ. Press, Cambridge (1978).
Cutland N. J., Computability, Cambridge Univ. Press, Cambridge (1980).
Odifreddi P., Classical Recursion Theory. Vol. 1, North-Holland, Amsterdam etc. (1989).
Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York; St. Louis; San Francisco; Toronto; London; Sydney (1967).
Chang C. C. and Keisler H. J., Model Theory, North-Holland, Amsterdam (1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Combarro, E.F. Computable Solutions of Equations over Endomorphisms of Negative Numberings. Siberian Mathematical Journal 44, 821–828 (2003). https://doi.org/10.1023/A:1025936819861
Issue Date:
DOI: https://doi.org/10.1023/A:1025936819861