Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon.

Saved in:
Bibliographic Details
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!
id 5006229930
ctrlnum (MiAaPQ)5006229930
(Au-PeEL)EBL6229930
(OCoLC)1153270619
collection bib_alma
record_format marc
spelling Downey, R. G. (Rod G.), author.
Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
Providence, Rhode Island : American Mathematical Society, 2020.
1 online resource (104 pages).
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Memoirs of the American Mathematical Society ; Volume 265, Number 1284
Includes bibliographical references.
Description based on print version record.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
Unsolvability (Mathematical logic)
Recursively enumerable sets.
Computable functions.
Electronic books.
Ng, Keng Meng, author.
Solomon, Reed, author.
Print version: Downey, R. G. (Rod G.) Minimal weak truth table degrees and computably enumerable Turing degrees. Providence, Rhode Island : American Mathematical Society, 2020 104 pages Memoirs of the American Mathematical Society ; Volume 265, Number 1284. 9781470441623 (DLC) 2020023541
ProQuest (Firm)
Memoirs of the American Mathematical Society ; Volume 265, Number 1284.
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6229930 Click to View
language English
format eBook
author Downey, R. G.
Ng, Keng Meng,
Solomon, Reed,
spellingShingle Downey, R. G.
Ng, Keng Meng,
Solomon, Reed,
Minimal weak truth table degrees and computably enumerable Turing degrees /
Memoirs of the American Mathematical Society ;
author_facet Downey, R. G.
Ng, Keng Meng,
Solomon, Reed,
Ng, Keng Meng,
Solomon, Reed,
author_variant r g d rg rgd
k m n km kmn
r s rs
author_fuller (Rod G.),
author_role VerfasserIn
VerfasserIn
VerfasserIn
author2 Ng, Keng Meng,
Solomon, Reed,
author2_role TeilnehmendeR
TeilnehmendeR
author_sort Downey, R. G.
title Minimal weak truth table degrees and computably enumerable Turing degrees /
title_full Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
title_fullStr Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
title_full_unstemmed Minimal weak truth table degrees and computably enumerable Turing degrees / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
title_auth Minimal weak truth table degrees and computably enumerable Turing degrees /
title_new Minimal weak truth table degrees and computably enumerable Turing degrees /
title_sort minimal weak truth table degrees and computably enumerable turing degrees /
series Memoirs of the American Mathematical Society ;
series2 Memoirs of the American Mathematical Society ;
publisher American Mathematical Society,
publishDate 2020
physical 1 online resource (104 pages).
isbn 9781470461362 (e-book)
9781470441623
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.63 D696 42020
genre Electronic books.
genre_facet Electronic books.
url https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6229930
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.3/5
dewey-sort 3511.3 15
dewey-raw 511.3/5
dewey-search 511.3/5
oclc_num 1153270619
work_keys_str_mv AT downeyrg minimalweaktruthtabledegreesandcomputablyenumerableturingdegrees
AT ngkengmeng minimalweaktruthtabledegreesandcomputablyenumerableturingdegrees
AT solomonreed minimalweaktruthtabledegreesandcomputablyenumerableturingdegrees
status_str n
ids_txt_mv (MiAaPQ)5006229930
(Au-PeEL)EBL6229930
(OCoLC)1153270619
carrierType_str_mv cr
hierarchy_parent_title Memoirs of the American Mathematical Society ; Volume 265, Number 1284
hierarchy_sequence Volume 265, Number 1284.
is_hierarchy_title Minimal weak truth table degrees and computably enumerable Turing degrees /
container_title Memoirs of the American Mathematical Society ; Volume 265, Number 1284
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1792331021128040449
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02087nam a2200445 i 4500</leader><controlfield tag="001">5006229930</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20201010074155.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">201010s2020 riu ob 000 0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781470441623</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781470461362 (e-book)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5006229930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL6229930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1153270619</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.63</subfield><subfield code="b">.D696 2020</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Downey, R. G.</subfield><subfield code="q">(Rod G.),</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimal weak truth table degrees and computably enumerable Turing degrees /</subfield><subfield code="c">Rodney G. Downey, Keng Meng Ng, Reed Solomon.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, Rhode Island :</subfield><subfield code="b">American Mathematical Society,</subfield><subfield code="c">2020.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (104 pages).</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Memoirs of the American Mathematical Society ;</subfield><subfield code="v">Volume 265, Number 1284</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on print version record.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Unsolvability (Mathematical logic)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursively enumerable sets.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computable functions.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ng, Keng Meng,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solomon, Reed,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Downey, R. G. (Rod G.)</subfield><subfield code="t">Minimal weak truth table degrees and computably enumerable Turing degrees.</subfield><subfield code="d">Providence, Rhode Island : American Mathematical Society, 2020 </subfield><subfield code="h">104 pages </subfield><subfield code="k">Memoirs of the American Mathematical Society ; Volume 265, Number 1284.</subfield><subfield code="z">9781470441623 </subfield><subfield code="w">(DLC) 2020023541</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Memoirs of the American Mathematical Society ;</subfield><subfield code="v">Volume 265, Number 1284.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6229930</subfield><subfield code="z">Click to View</subfield></datafield></record></collection>