MathSciNet bibliographic data

MR1724930 (2001i:03093) 03D45 (03D15) Cenzer, Douglas; Remmel, Jeffrey B. Polynomial-time versus computable Boolean algebras. Recursion theory and complexity (Kazan, 1997), 15--53, de Gruyter Ser. Log. Appl., 2, de Gruyter, Berlin, 1999.

Links to the journal or article are not yet available

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