Your search returned 5 results.

Sort
Results
1.
Automorphisms of the lattice of recursively enumerable sets/ Peter Cholak. by
  • Cholak, Peter, 1962-
Series: Memoirs of the American Mathematical Society ; no. 541.
Publication details: Providence, R.I.: American Mathematical Society, 1995
Availability: Items available for loan: Castorina (1).

2.
Minimal weak truth table degrees and computably enumerable Turing degrees/ Rodney G. Downey, Keng Meng Ng, Reed Solomon. by
  • Downey, R. G. (Rod G.) [author.]
  • Ng, Keng Meng [author.]
  • Solomon, Reed [author.]
Series: Memoirs of the American Mathematical Society ; no. 1284.
Publisher: Providence, RI: American Mathematical Society, 2020
Availability: Items available for loan: Castorina (1).

3.
A hierarchy of Turing degrees: a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability/ Rod Downey, Noam Greenberg. by
  • Downey, R. G. (Rod G.)
  • Greenberg, Noam, 1974-
Series: Annals of mathematics studies ; no. 206.
Publisher: Princeton, New Jersey: Princeton University Press, 2020
Availability: Items available for loan: Castorina (1)Call number: 511.3 D748h 2020 IMPA.

4.
The role of true finiteness in the admissible recursively enumerable degrees/ Noam Greenberg. by
  • Greenberg, Noam, 1974-
Series: Memoirs of the American Mathematical Society ; no. 854,
Publication details: Providence, R.I.: American Mathematical Society, c2006
Availability: Items available for loan: Castorina (1).

5.
Recursively enumerable sets and degrees: a study of computable functions and computably generated sets/ Robert I. Soare. by
  • Soare, R. I. (Robert Irving), 1940-
Series: Perspectives in mathematical logic
Publication details: Berlin ; New York: Springer-Verlag, c1987
Availability: Items available for loan: Castorina (1)Call number: 511.3 S676r 1987 IMPA.

Pages
© 2023 IMPA Library | Customized & Maintained by Sérgio Pilotto


Powered by Koha