Recursive algebra, analysis and combinatorics

Author(s)

• Ershov, I︠U︡riĭ Leonidovich

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, V.M. Marek ; v. 2）

Elsevier, 1998

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"

Details

• NCID: BA39474222
• ISBN:
  • 0444501061
• LCCN: 98048059
• Country Code: ne
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Amsterdam
• Pages/Volumes: xlvi, 623-1372 p.
• Size: 24 cm
• Classification:
  • LCC : QA9.6
  • DC21 : 511.3/5
• Subject Headings:
  • LCSH : Recursion theory
• Parent Bibliography ID:
  • BA00099329