Image from Amazon.com
Recursively enumerable sets and degrees : a study of computable functions and computably generated sets
Material type:
TextSeries: Perspectives in Mathematical LogicPublication details: New York : Springer, ©1987.Description: xii, 437 p. : ill. ; 23 cmISBN: - 9783540666813
- 511.3 SOA-R
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
IIITD Reference | Mathematics | REF 511.3 SOA-R (Browse shelf(Opens below)) | Available | 010376 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 511.3 ROG-T Theory of recursive functions and effective computability | REF 511.3 RUC-I Infinity and the mind : the science and philosophy of the infinite | REF 511.3 SCH-L Logic for computer scientists | REF 511.3 SOA-R Recursively enumerable sets and degrees : | REF 511.3 STE-F The foundations of mathematics | REF 511.3 VEL-H How to prove it : a structured approach | REF 511.322 FRI-S Sets and computations |
This book contains Notation Index and References.
There are no comments on this title.