MathSciNet bibliographic data

MR2395047 (2009c:03035) 03D25 Cholak, Peter A.; Downey, Rodney; Harrington, Leo A. The complexity of orbits of computably enumerable sets. Bull. Symbolic Logic 14 (2008), no. 1, 69--87.

Article

For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page American Mathematical Society 201 Charles Street Providence, RI 02904-6248 USA © Copyright 2010, American Mathematical Society Privacy Statement