Abstract
We present a simple proof of a Theorem of Khutoretskij on the number of incomparable one-one numberings of an r.e. family of r.e. sets. The proof directly generalizes to effective domains. In the second part, applying a Theorem of Goncharov, we show that for anyk≧ there exist total recursive functions having exactlyk recursive isomorphism classes. Using a Theorem of Selivanov, it is shown that a certain notion of computability via gödelization is different from Lacombe's notion ofV-recursiveness. Finally, we discuss the complexity (w.r.t.T-degrees) of translating a Gödelnumbering into a direct sum of Friedbergnumberings.
Similar content being viewed by others
References
Ershov, Yu.L.: Theorie der Numerierungen. III. Z. Math. Logik Grundlagen Math.23, 289–371 (1977)
Friedberg, R.M.: Three Theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Logic23, 309–316 (1958)
Friedman, H.M.: Axiomatic recursive function theory. In: Gandy, R.O., Yates, C.E.M. (eds.) Logic Colloquium '69. (Stud. Logic Found. Math. vol. 61, pp. 113–137). Amsterdam: North-Holland 1971
Goncharov, S.S.: Computable single-valued numerations. Algebra Logic19, 325–356 (1980a)
Goncharov, S.S.: Problem of the number of non-self-equivalent constructivizations. Algebra Logic19, 401–414 (1980b)
Goncharov, S.S.: Groups with a finite number of constructivizations. Sov. Math. Dokl.23, 58–61 (1981)
Khusainov, B.M.: Strongly effective unars and nonautoequivalent constructivizations. In: Lavrent'ev, M.M. (ed.) Some problems in differential equations and discrete mathematics (Russian), pp. 33–44, Novosibirsk. Gos. Univ., Novosibirsk, 1986
Khusainov, B.M.: Algorithmic degree of unars. Algebra Logic27, 301–312 (1988)
Khutoretskij, A.B.: On the reducibility of computable numerations. Algebra Logic8, 145–151 (1969)
Kummer, M.: Numberings of R1∪F. In: Börger, E., Kleine Büning, H., Richter, M.M. (eds.) CSL '88 (Lect. Notes Comput. Sci., vol. 385, pp. 166–186) Berlin Heidelberg New York: Springer 1989a
Kummer, M.: A note on direct sums of Friedbergnumberings. J. Symb. Logic54, 1009–1010 (1989b)
Kummer, M.: Beiträge zur Theorie der Numerierungen: Eindeutige Numerierungen. Dissertation, Fakultät für Informatik, Universität Karlsruhe, 1989c
Kummer, M.: An easy priority-free proof of a theorem of Friedberg. Theor. Comput. Sci.74, 249–251 (1990a)
Kummer, M.: Recursive enumeration without repetition revisited. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds.) Recursion theory week (Lect. Notes Math., Vol. 1432, pp. 255–276). Berlin Heidelberg New York: Springer 1990b
Lacombe, D.: Deux généralisations de la notion de récursivité relative. C.R. Acad. Sci., Paris258, 3410–3413 (1964)
Maier, W.: Graphen total rekursiver Funktionen. Dissertation, Fakultät für Informatik, Universität Karlsruhe, 1981
Mal'tsev, A.I.: Algorithms and recursive functions. Groningen: Wolters-Noordhoff Publishing 1970. Original russian edition: Moskva: Izdatelstvo Nauka, 1965
Moschovakis, Y.N.: Abstract first order computability I. Trans. Am. Math. Soc.138, 427–464 (1969a)
Moschovakis, Y.N.: Abstract computability and invariant definability. J. Symb. Logic34, 605–633 (1969b)
Pour-El, M.B.: Gödel numberings versus Friedberg numberings. Proc. Am. Math. Soc.15, 252–256 (1964)
Rogers, H. jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967
Schnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Lect. Notes Math., vol. 218) Berlin Heidelberg New York: Springer, 1971
Selivanov, V.L.: Enumerations of families of general recursive functions. Algebra Logic15, 128–141 (1976)
Soare, R.I.: Recursively enumerable sets and degrees. Berlin Heidelberg New York: Springer, 1987
Sperschneider, V.: Gödelisierung. Technical Report Nr. 29/80. Fakultät für Informatik, Universität Karlsruhe, 1980
Spreen, D.: Computable one-to-one enumerations of effective domains. Inf. Comput.84, 26–46 (1990)
Ventsov, Y.G.: Nonuniform autostability of models. Algebra Logic26, 422–440 (1987)
Weihrauch, K.: Computability. Berlin Heidelberg New York: Springer 1987
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kummer, M. Some applications of computable one-one numberings. Arch Math Logic 30, 219–230 (1990). https://doi.org/10.1007/BF01792984
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01792984