A reducibility in the theory of iterative combinatory spaces

ЗаглавиеA reducibility in the theory of iterative combinatory spaces
Вид публикацияJournal Article
Година на публикуване2008
АвториSkordev D
СписаниеAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Том98
ключови думиcombinatory space, computable element, computable mapping, iterative combinatory space
Резюме

The notion of iterative combinatory space introduced in the past by the present author gave the framework for an algebraic generalization of a part of Computability Theory. In the present paper a reducibility concerning iterative combinatory spaces is considered, as well as the corresponding equivalence. A statement of J.~Zashev about variants of iterative combinatory spaces is shown to fail under certain interpretations of the notion of variant in the terms of the relations in question.

2000 MSC

main 03D75, secondary 03D50

Прикачен файлРазмер
PDF icon 98-087-099.pdf1.37 MB