|
This article is cited in 20 scientific papers (total in 20 papers)
Reducibility on families
I. Sh. Kalimullina, V. G. Puzarenkob a Department of Algebra and Mathematical Logics, N. G. Chebotarev Research Institute of Mathematics and Mechanics, Kazan State University, Kazan, Russia
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
A reducibility on families of subsets of natural numbers is introduced which allows the family per se to be treated without its representation by natural numbers being fixed. This reducibility is used to study a series of problems both in classical computability and on admissible sets: for example, describing index sets of families belonging to $\Sigma_3^0 $, generalizing Friedberg's completeness theorem for a suitable reducibility on admissible sets, etc.
Keywords:
family of subsets of natural numbers, admissible set, reducibility.
Received: 29.11.2007 Revised: 30.10.2008
Citation:
I. Sh. Kalimullin, V. G. Puzarenko, “Reducibility on families”, Algebra Logika, 48:1 (2009), 31–53; Algebra and Logic, 48:1 (2009), 20–32
Linking options:
https://www.mathnet.ru/eng/al389 https://www.mathnet.ru/eng/al/v48/i1/p31
|
Statistics & downloads: |
Abstract page: | 583 | Full-text PDF : | 192 | References: | 93 | First page: | 5 |
|