D.Kh. Zainetdinov

Kazan Federal University, Kazan, 420008 Russia

E-mail:  damir.zh@mail.ru

Received December 24, 2017

Full text PDF

Abstract

The paper is devoted to the study of limitwise monotonic sets, as well as to the investigation of the main structural properties of limitwise monotonic reducibility (lm-reducibility) between set and sequence of sets. Limitwise monotonic reducibility can be regarded as a special case of Σ-reducibility defined on families of initial segments of natural numbers. In this paper, lm-reducibility between set and sequence consisting of infinite sets has been considered in the language of the limitwise monotonic operator. The main result of this paper is the proof of the absence of the least non-limitwise monotonic sequence with respect to lm-reducibility between set and sequence of sets. This result as been proved with the help of the infinite injury priority method with the use of the tree of strategies. The result presented in this paper is a generalization of the result that there are no least non-limitwise monotonic Σ₂⁰-set under lm-reducibility of sets.

Keywords: limitwise monotonic function, limitwise monotonic set, limitwise monotonic operator, limitwise monotonic reducibility, sequence of sets, Σ₂⁰-set

Acknowledgments. The research was funded by the subsidy allocated to Kazan Federal University for the state assignment in the sphere of scientific activities, project no. 1.1515.2017/4.6.

References

1. Khisamiev N.G. Criterion for constructivizability of a direct sum of cyclic p-groups. Izv. Akad. Nauk Kaz. SSR Ser. Fiz.-Mat., 1981, vol. 98, no. 1, pp. 51–55. (In Russian)

2. Khisamiev N.G. Arithmetic hierarchy of abelian groups. Sib. Math. J., 1988, vol. 29, no. 6, pp. 987–999. doi: 10.1007/BF00972425.

3. Khisamiev N.G. Constructive abelian groups. Stud. Logic Found. Math., 1998, vol. 139, pp. 1177–1231. doi: 10.1016/S0049-237X(98)80050-5.

4. Downey R.G., Kach A.M., Turetsky D. Limitwise monotonic functions and their applications. Proc. 11th Asian Logic Conf., 2011, pp. 59–85. doi: 10.1142/9789814360548_0004.

5. Khoussainov B., Nies A., Shore R. Computable models of theories with few models. Notre Dame J. Formal Logic, 1997, vol. 38, no. 2, pp. 165–178. doi: 10.1305/ndjfl/1039724885.

6. Kalimullin I., Khoussainov B., Melnikov A. Limitwise monotonic sequences and degree spectra of structures. Proc. Am. Math. Soc., 2013, vol. 141, no. 9, pp. 3275–3289. doi: 10.1090/S0002-9939-2013-11586-8.

7. Kach A., Turetsky D. Limitwise monotonic functions, sets, and degrees on computable domains. J. Symb. Logic., 2010, vol. 75, no. 1, pp. 131–154. doi: 10.2178/jsl/1264433912.

8. Zainetdinov D.Kh., Kalimullin I.Sh. On limitwise monotonic reducibility of Σ₂⁰-sets. Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2014, vol. 156, no. 1, pp. 22–30. (In Russian)

9. Faizrahmanov M., Kalimullin I., Zainetdinov D. Maximality and minimality under limitwise monotonic reducibility. Lobachevskii J. Math., 2014, vol. 35, no. 4, pp. 333–338. doi: 10.1134/S1995080214040155.

10. Zainetdinov D.Kh. Limitwise monotonic reducibility on sets and on pairs of sets. Russ. Math., 2016, vol. 60, no. 3, pp. 85–88. doi: 10.3103/S1066369X16030117.

11. Goncharov S., Harizanov V., Knight J., McCoy C., Miller R., Solomon R. Enumerations in computable structure theory. Ann. Pure Appl. Logic, 2005, vol. 136, no. 3, pp. 219–246. doi: 10.1016/j.apal.2005.02.001.

12. Kalimullin I.Sh., Puzarenko V.G. Reducibility on families. Algebra Logic, 2009, vol. 48, no. 1, pp. 20–32. doi: 10.1007/s10469-009-9037-1.

13. Zainetdinov D.Kh. Σ-reducibility and lm-reducibility of sets and sequences of sets. Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2016, vol. 158, no. 1, pp. 51–65. (In Russian)

For citation: Zainetdinov D.Kh. Structural properties of limitwise monotonic reducibility of sequences of sets. Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2018, vol. 160, no. 3, pp. 517–527. (In Russian) 

The content is available under the license Creative Commons Attribution 4.0 License.