id: 01244079
dt: b
an: 01244079
au: Ershov, Yu.L. (ed.); Goncharov, S.S. (ed.); Nerode, A. (ed.); Remmel, J.B.
    (ed.); Marek, V.W. (ed.)
ti: Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and
    combinatorics.
so: Studies in Logic and the Foundations of Mathematics. 139. Amsterdam:
    Elsevier. xlvi, 623‒1372 Dfl. 275.00, \$ 158.00 vol. 2; Dfl. 450.00,
    \$ 258.50 set (1998).
py: 1998
pu: Amsterdam: Elsevier
la: EN
cc: 
ut: Handbook; Recursive mathematics; Recursive algebra; Recursive analysis;
    Recursive combinatorics
ci: 
li: 
ab: [|The articles of this volume will be reviewed individually.] Contents:
    {\it Yu. L. Ershov}, {\it S. S. Goncharov}, {\it A. Nerode} and {\it J.
    B. Remmel}, “Introduction to the Handbook of recursive mathematics"
    (pp. vii‒xlvi); {\it D. Cenzer} and {\it J. B. Remmel}, “$Π_1^0$
    classes in mathematics" (pp. 623-821); {\it R. G. Downey},
    “Computability theory and linear orderings" (pp. 823-976); {\it R. G.
    Downey} and {\it J. B. Remmel}, “Computable algebras and closure
    systems: Coding properties" (pp. 977-1039); {\it W. Gasarch}, “A
    survey of recursive combinatorics" (pp. 1041-1176); {\it N. G.
    Khisamiev}, “Constructive Abelian groups" (pp. 1177-1231); {\it H. A.
    Kierstead}, “Recursive and on-line graph coloring" (pp. 1233-1269);
    {\it K. Ko}, “Polynomial-time computability in analysis" (pp.
    1271-1317); {\it S. P. Odintsov}, “Generally constructive Boolean
    algebras" (pp. 1319-1354); {\it S. G. Simpson} and {\it J. Rao},
    “Reverse algebra" (pp. 1355-1372).
rv: