Abstract
We obtain a sufficient condition for the absence of any universal Σ-function in an admissible set (a hereditarily finite admissible set). We construct a tree T of height 4 such that no universal Σ-function exists in the hereditarily finite admissible set ℍ\(\mathbb{F} \)(T) over T.
Similar content being viewed by others
References
Ershov Yu. L., Definability and Computability, Consultants Bureau, New York and London (1996).
Rudnev V. A., “A universal recursive function on admissible sets,” Algebra and Logic, 25, No. 4, 267–273 (1986).
Morozov A. S. and Puzarenko V. G., “Σ-subsets of natural numbers,” Algebra and Logic, 43, No. 3, 162–178 (2004).
Kalimullin I. Sh. and Puzarenko V. G., “Computability principles on admissible sets,” Siberian Adv. in Math., 15, No. 4, 1–33 (2005).
Puzarenko V. G., “Computability in special models,” Siberian Math. J., 46, No. 1, 148–165 (2005).
Khisamiev A. N., “On Σ-subsets of naturals over abelian groups,” Siberian Math. J., 47, No. 3, 574–583 (2006).
Khisamiev A. N., “Σ-Bounded algebraic systems and universal functions. I,” Siberian Math. J., 51, No. 1, 178–192 (2010).
Khisamiev A. N., “Σ-Bounded algebraic systems and universal functions. II,” Siberian Math. J., 51,No. 3, 537–551 (2010).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2012 Khisamiev A. N.
The author was supported by the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-276.2012.1).
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 53, No. 3, pp. 687–690, May–June, 2012.
Rights and permissions
About this article
Cite this article
Khisamiev, A.N. On a universal Σ-function over a tree. Sib Math J 53, 551–553 (2012). https://doi.org/10.1134/S0037446612020358
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446612020358