Degrees of unsolvability /
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Amsterdam ; London :
North-Holland Pub. Co.,
1971.
|
Colección: | North-Holland mathematics studies ;
2. |
Temas: | |
Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | SCIDIR_ocn316552961 | ||
003 | OCoLC | ||
005 | 20231117015224.0 | ||
006 | m o d | ||
007 | cr cn||||||||| | ||
008 | 090320s1971 enk o 000 0 eng d | ||
040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d OCLCF |d OCLCO |d DEBBG |d N$T |d IDEBK |d MERUC |d E7B |d OCLCE |d OCLCQ |d COO |d OCLCQ |d DEBSZ |d LEAUB |d ADU |d VLY |d S2H |d OCLCO |d OCLCQ |d OCLCO | ||
019 | |a 310913139 |a 625165263 |a 646774132 |a 680277922 |a 1086560150 |a 1112819428 |a 1160009966 |a 1162405909 | ||
020 | |a 9780720420616 | ||
020 | |a 072042061X | ||
020 | |a 9780080871134 |q (electronic bk.) | ||
020 | |a 0080871135 |q (electronic bk.) | ||
020 | |a 9780444101280 | ||
020 | |a 0444101284 | ||
020 | |a 1281777641 | ||
020 | |a 9781281777645 | ||
020 | |a 9786611777647 | ||
020 | |a 6611777644 | ||
020 | |z 0444101284 | ||
035 | |a (OCoLC)316552961 |z (OCoLC)310913139 |z (OCoLC)625165263 |z (OCoLC)646774132 |z (OCoLC)680277922 |z (OCoLC)1086560150 |z (OCoLC)1112819428 |z (OCoLC)1160009966 |z (OCoLC)1162405909 | ||
042 | |a dlr | ||
050 | 4 | |a QA1 |b .N855 no.2eb | |
072 | 7 | |a MAT |x 016000 |2 bisacsh | |
072 | 7 | |a MAT |x 018000 |2 bisacsh | |
082 | 0 | 4 | |a 511/.3 |2 22 |
100 | 1 | |a Shoenfield, Joseph Robert. | |
245 | 1 | 0 | |a Degrees of unsolvability / |c Joseph R. Shoenfield. |
260 | |a Amsterdam ; |a London : |b North-Holland Pub. Co., |c 1971. | ||
300 | |a 1 online resource (viii, 111 pages) | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
490 | 1 | |a North-Holland mathematics studies ; |v 2 | |
588 | 0 | |a Print version record. | |
505 | 0 | |a Front Cover; Degrees of Unsolvability; Copyright Page; Contents; Introduction; Chapter 0. Terminology and Notation; Chapter 1. Recursive Functions; Chapter 2. Isomorphisms; Chapter 3. Algorithms; Chapter 4. Relative Recursiveness; Chapter 5. Recursive Enumerability; Chapter 6. Degrees; Chapter 7. Evaluating Degrees; Chapter 8. Incomparable Degrees; Chapter 9. Upper and Lower Bounds; Chapter 10. The Jump Operation; Chapter 11. Minimal Degrees; Chapter 12. Simple Sets; Chapter 13. The Priority Method; Chapter 14. The Splitting Theorem; Chapter 15. Maximal Sets; Chapter 16. Infinite Injury. | |
506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
546 | |a English. | ||
650 | 0 | |a Recursive functions. | |
650 | 6 | |a Fonctions r�ecursives. |0 (CaQQLa)201-0024594 | |
650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
650 | 7 | |a Recursive functions |2 fast |0 (OCoLC)fst01091984 | |
776 | 0 | 8 | |i Print version: |a Shoenfield, Joseph Robert. |t Degrees of unsolvability. |d Amsterdam ; London : North-Holland Pub. Co., 1971 |z 072042061X |z 9780720420616 |w (OCoLC)16189044 |
830 | 0 | |a North-Holland mathematics studies ; |v 2. | |
856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780720420616 |z Texto completo |
856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=03040208&volume=2 |z Texto completo |
856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/03040208/2 |z Texto completo |