Abstract
We describe constructions that are used in the proof of the main result of the first part of the article. They are based on automorphisms and properties of the Cantor space.
Similar content being viewed by others
REFERENCES
Yu. L. Ershov, Definability and Computability (Nauchnaya Kniga, Novosibisrk, 1996; Consultants Bureau, New York, 1996).
W. Hodges, Model Theory (Cambridge Univ. Press, Cambridge, 1993).
I. Sh. Kalimullin and V. G. Puzarenko, “Reducibility on families,” Algebra i logika 48, 31 (2009) [Algebra and Logic 48, 20 (2009)].
I. Sh. Kalimullin, V. G. Puzarenko, and M. Kh. Faĭzrakhmanov, “Negative numberings in admissible sets. I,” Mat. Trudy 26, no. 1, 47 (2023) [Siberian Adv. Math. 33, 293 (2023)].
V. G. Puzarenko, “Decidable computable \(\mathbb {A} \)-numberings,” Algebra i logika 41, 568 (2002) [Algebra and Logic 41, 314 (2002)].
Funding
The work of the first and third authors was partially supported by the Russian Scientific Foundation (project no. 23-21-00181) and carried out within the framework of the Program for development of the Scientific and Educational Mathematical Center of Volga Federal District (agreement no. 075-02-2023-944). The work of the second author was partially supported by the Russian Ministry of Science and Higher Education (project no. FWNF-2022-0012).
Author information
Authors and Affiliations
Corresponding authors
Additional information
CONFLICT OF INTEREST. The authors of this work declare that they have no conflicts of interest.
Publisher’s Note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Kalimullin, I.S., Puzarenko, V.G. & Faizrakhmanov, M.K. Negative Numberings in Admissible Sets. II. Sib. Adv. Math. 34, 41–66 (2024). https://doi.org/10.1134/S1055134424010024
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1055134424010024