Recursive algebra, analysis and combinatorics
Author(s)
Bibliographic Information
Recursive algebra, analysis and combinatorics
(Studies in logic and the foundations of mathematics, v. 139 . Handbook of recursive mathematics / edited by Yu. L. Ershov ... [et al.] ; associate editor,
Elsevier, 1998
Available at 32 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C||Handbook-29||298075054
Note
Includes bibliographical references
Description and Table of Contents
Table of Contents
01 classes in mathematics (D. Cenzer, J.B. Remmel). Computability theory and linear orderings (R.G. Downey). Computable algebras and closure systems: coding properties (R.G. Downey, J.B. Remmel). A survey of recursive combinatorics (W. Gasarch). Constructive abelian groups (N.G. Khisamiev). Recursive and on-line graph coloring (H.A. Kierstead). Polynominal-time computability in analysis (K. Ko). Generally constructive Boolean algebras (S.P. Odintsov). Reverse algebra (S.G. Simpson, J. Rao).
by "Nielsen BookData"