Definability of R. E. Sets in a Class of Recursion Theoretic Structures
Byerly, Robert E.
J. Symbolic Logic, Tome 48 (1983) no. 1, p. 662-669 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1983-09-14
Classification:  
@article{1183741325,
     author = {Byerly, Robert E.},
     title = {Definability of R. E. Sets in a Class of Recursion Theoretic Structures},
     journal = {J. Symbolic Logic},
     volume = {48},
     number = {1},
     year = {1983},
     pages = { 662-669},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741325}
}

Byerly, Robert E. Definability of R. E. Sets in a Class of Recursion Theoretic Structures. J. Symbolic Logic, Tome 48 (1983) no. 1, pp.  662-669. http://gdmltest.u-ga.fr/item/1183741325/