On Recursion Theory in $I\sum_1$

Hajek, Petr; Kucera, Antonin

J. Symbolic Logic, Tome 54 (1989) no. 1, p. 576-589 / Harvested from Project Euclid

Résumé

It is shown that the low basis theorem is meaningful and provable in $I\sum_1$ and that the priority-free solution to Post's problem formalizes in this theory.

Publié le : 1989-06-14
Classification:

@article{1183742928,
     author = {Hajek, Petr and Kucera, Antonin},
     title = {On Recursion Theory in $I\sum\_1$},
     journal = {J. Symbolic Logic},
     volume = {54},
     number = {1},
     year = {1989},
     pages = { 576-589},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742928}
}

Hajek, Petr; Kucera, Antonin. On Recursion Theory in $I\sum_1$. J. Symbolic Logic, Tome 54 (1989) no. 1, pp.  576-589. http://gdmltest.u-ga.fr/item/1183742928/