Normal view MARC view ISBD view

Computability, enumerability, unsolvability: directions in recursion theory/

Computability, enumerability, unsolvability: directions in recursion theory/ edited by S.B. Cooper, T.A. Slaman, S.S. Wainer. - Cambridge, UK; New York: Cambridge University Press, 1996. - vii, 347 p.; 23 cm. - London Mathematical Society lecture note series; 224 .

Includes bibliographical references.

ISBN: 0521557364 (pbk.)

LCCN: 95044750

Nat. Bib. No.: GB95-96524

Subjects--Topical Terms:
Recursion theory.
Récursivité, Théorie de la.

Subjects--Index Terms: Mathematical logic

Dewey Class. No.: 511.3 / C738

Place hold
Print
Add to your cart (remove)
Suggest for purchase
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)