Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
Saved in:
| Superior document: | Memoirs of the American Mathematical Society ; Volume 265, Number 1284 |
|---|---|
| VerfasserIn: | |
| TeilnehmendeR: | |
| Place / Publishing House: | Providence, Rhode Island : : American Mathematical Society,, 2020. |
| Year of Publication: | 2020 |
| Language: | English |
| Series: | Memoirs of the American Mathematical Society ;
Volume 265, Number 1284. |
| Online Access: | |
| Physical Description: | 1 online resource (104 pages). |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02087nam a2200445 i 4500 | ||
|---|---|---|---|
| 001 | 5006229930 | ||
| 003 | MiAaPQ | ||
| 005 | 20201010074155.0 | ||
| 006 | m o d | | ||
| 007 | cr cnu|||||||| | ||
| 008 | 201010s2020 riu ob 000 0 eng d | ||
| 020 | |z 9781470441623 | ||
| 020 | |a 9781470461362 (e-book) | ||
| 035 | |a (MiAaPQ)5006229930 | ||
| 035 | |a (Au-PeEL)EBL6229930 | ||
| 035 | |a (OCoLC)1153270619 | ||
| 040 | |a MiAaPQ |b eng |e rda |e pn |c MiAaPQ |d MiAaPQ | ||
| 050 | 4 | |a QA9.63 |b .D696 2020 | |
| 082 | 0 | |a 511.3/5 |2 23 | |
| 100 | 1 | |a Downey, R. G. |q (Rod G.), |e author. | |
| 245 | 1 | 0 | |a Minimal weak truth table degrees and computably enumerable Turing degrees / |c Rodney G. Downey, Keng Meng Ng, Reed Solomon. |
| 264 | 1 | |a Providence, Rhode Island : |b American Mathematical Society, |c 2020. | |
| 300 | |a 1 online resource (104 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 Memoirs of the American Mathematical Society ; |v Volume 265, Number 1284 | |
| 504 | |a Includes bibliographical references. | ||
| 588 | |a Description based on print version record. | ||
| 590 | |a Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. | ||
| 650 | 0 | |a Unsolvability (Mathematical logic) | |
| 650 | 0 | |a Recursively enumerable sets. | |
| 650 | 0 | |a Computable functions. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Ng, Keng Meng, |e author. | |
| 700 | 1 | |a Solomon, Reed, |e author. | |
| 776 | 0 | 8 | |i Print version: |a Downey, R. G. (Rod G.) |t Minimal weak truth table degrees and computably enumerable Turing degrees. |d Providence, Rhode Island : American Mathematical Society, 2020 |h 104 pages |k Memoirs of the American Mathematical Society ; Volume 265, Number 1284. |z 9781470441623 |w (DLC) 2020023541 |
| 797 | 2 | |a ProQuest (Firm) | |
| 830 | 0 | |a Memoirs of the American Mathematical Society ; |v Volume 265, Number 1284. | |
| 856 | 4 | 0 | |u https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6229930 |z Click to View |