FIRST ORDER AXIOMATIZABILITY OF RECURSION THEORY IN CARTESIAN LINEAR COMBINATORY ALGEBRAS

ЗаглавиеFIRST ORDER AXIOMATIZABILITY OF RECURSION THEORY IN CARTESIAN LINEAR COMBINATORY ALGEBRAS
Вид публикацияJournal Article
Година на публикуване1998
АвториZashev J
СписаниеAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Том90
IssueLivre 1 - Mathématiques et Mecanique
Pagination41-50
ISSN0205-0808
ключови думиAlgebraic recursion theory, axiomatic recursion theory, combinatory algebras
Резюме

A modification of recursion theorem in Cartesian linear combinatory algebras is proved which yields first order formalizability of theory of the last algebras. Some other improvements of this theory are demonstrated.

1991/95 MSC

03D75

Прикачен файлРазмер
PDF icon 90-041-050.pdf946.7 KB