A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /

A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / / Noam Greenberg, Rod Downey.

Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English
VerfasserIn:
Downey, Rod,
Greenberg, Noam,
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2020]
©2020
Year of Publication:2020
Language:English
Series:Annals of Mathematics Studies ; 382
Online Access:
Physical Description:1 online resource (240 p.) :; 3 b/w illus.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9780691200217
lccn 2019052456
ctrlnum (DE-B1597)544905
(OCoLC)1196361575
collection bib_alma
record_format marc
spelling Downey, Rod, author. aut http://id.loc.gov/vocabulary/relators/aut
A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / Noam Greenberg, Rod Downey.
Princeton, NJ : Princeton University Press, [2020]
©2020
1 online resource (240 p.) : 3 b/w illus.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Annals of Mathematics Studies ; 382
Frontmatter -- Contents -- Acknowledgments -- Chapter One. Introduction -- Chapter Two. ɑ-c.a. functions -- Chapter Three. The hierarchy of totally ɑ-c.a. degrees -- Chapter Four. Maximal totally ɑ-c.a. degrees -- Chapter Five. Presentations of left-c.e. reals -- Chapter Six. m-topped degrees -- Chapter Seven. Embeddings of the 1-3-1 lattice -- Chapter Eight. Prompt permissions -- Bibliography
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)
Computable functions.
Recursively enumerable sets.
Unsolvability (Mathematical logic)
Unsolvability (Mathematical logic).
MATHEMATICS / Logic. bisacsh
Recursion theory.
c.e. degrees.
c.e. reals.
computable model theory.
lattice embeddings.
m-topped degrees.
mind changes in computability theory.
modern computability theory.
pi-zero-one classes.
prompt permissions.
relative recursive randomness.
transfinite hierarchy of Turing degrees.
Greenberg, Noam, author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English 9783110704716
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 9783110704518 ZDB-23-DGG
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 English 9783110704846
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 9783110704662 ZDB-23-DMA
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 9783110494914 ZDB-23-PMB
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2020 9783110690088
print 9780691199665
https://doi.org/10.1515/9780691200217?locatt=mode:legacy
https://www.degruyter.com/isbn/9780691200217
Cover https://www.degruyter.com/document/cover/isbn/9780691200217/original
language English
format eBook
author Downey, Rod,
Downey, Rod,
Greenberg, Noam,
spellingShingle Downey, Rod,
Downey, Rod,
Greenberg, Noam,
A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
Annals of Mathematics Studies ;
Frontmatter --
Contents --
Acknowledgments --
Chapter One. Introduction --
Chapter Two. ɑ-c.a. functions --
Chapter Three. The hierarchy of totally ɑ-c.a. degrees --
Chapter Four. Maximal totally ɑ-c.a. degrees --
Chapter Five. Presentations of left-c.e. reals --
Chapter Six. m-topped degrees --
Chapter Seven. Embeddings of the 1-3-1 lattice --
Chapter Eight. Prompt permissions --
Bibliography
author_facet Downey, Rod,
Downey, Rod,
Greenberg, Noam,
Greenberg, Noam,
Greenberg, Noam,
author_variant r d rd
r d rd
n g ng
author_role VerfasserIn
VerfasserIn
VerfasserIn
author2 Greenberg, Noam,
Greenberg, Noam,
author2_variant n g ng
author2_role VerfasserIn
VerfasserIn
author_sort Downey, Rod,
title A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
title_sub A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
title_full A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / Noam Greenberg, Rod Downey.
title_fullStr A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / Noam Greenberg, Rod Downey.
title_full_unstemmed A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / Noam Greenberg, Rod Downey.
title_auth A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
title_alt Frontmatter --
Contents --
Acknowledgments --
Chapter One. Introduction --
Chapter Two. ɑ-c.a. functions --
Chapter Three. The hierarchy of totally ɑ-c.a. degrees --
Chapter Four. Maximal totally ɑ-c.a. degrees --
Chapter Five. Presentations of left-c.e. reals --
Chapter Six. m-topped degrees --
Chapter Seven. Embeddings of the 1-3-1 lattice --
Chapter Eight. Prompt permissions --
Bibliography
title_new A Hierarchy of Turing Degrees :
title_sort a hierarchy of turing degrees : a transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability (ams-206) /
series Annals of Mathematics Studies ;
series2 Annals of Mathematics Studies ;
publisher Princeton University Press,
publishDate 2020
physical 1 online resource (240 p.) : 3 b/w illus.
Issued also in print.
contents Frontmatter --
Contents --
Acknowledgments --
Chapter One. Introduction --
Chapter Two. ɑ-c.a. functions --
Chapter Three. The hierarchy of totally ɑ-c.a. degrees --
Chapter Four. Maximal totally ɑ-c.a. degrees --
Chapter Five. Presentations of left-c.e. reals --
Chapter Six. m-topped degrees --
Chapter Seven. Embeddings of the 1-3-1 lattice --
Chapter Eight. Prompt permissions --
Bibliography
isbn 9780691200217
9783110704716
9783110704518
9783110704846
9783110704662
9783110494914
9783110690088
9780691199665
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA9
callnumber-sort QA 19.63 D69 42020
url https://doi.org/10.1515/9780691200217?locatt=mode:legacy
https://www.degruyter.com/isbn/9780691200217
https://www.degruyter.com/document/cover/isbn/9780691200217/original
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.3
dewey-sort 3511.3
dewey-raw 511.3
dewey-search 511.3
doi_str_mv 10.1515/9780691200217?locatt=mode:legacy
oclc_num 1196361575
work_keys_str_mv AT downeyrod ahierarchyofturingdegreesatransfinitehierarchyoflownessnotionsinthecomputablyenumerabledegreesunifyingclassesandnaturaldefinabilityams206
AT greenbergnoam ahierarchyofturingdegreesatransfinitehierarchyoflownessnotionsinthecomputablyenumerabledegreesunifyingclassesandnaturaldefinabilityams206
AT downeyrod hierarchyofturingdegreesatransfinitehierarchyoflownessnotionsinthecomputablyenumerabledegreesunifyingclassesandnaturaldefinabilityams206
AT greenbergnoam hierarchyofturingdegreesatransfinitehierarchyoflownessnotionsinthecomputablyenumerabledegreesunifyingclassesandnaturaldefinabilityams206
status_str n
ids_txt_mv (DE-B1597)544905
(OCoLC)1196361575
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English
Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020 English
Title is part of eBook package: De Gruyter EBOOK PACKAGE Mathematics 2020
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2020
is_hierarchy_title A Hierarchy of Turing Degrees : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /
container_title Title is part of eBook package: De Gruyter EBOOK PACKAGE COMPLETE 2020 English
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1806143276998197248
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05672nam a22009975i 4500</leader><controlfield tag="001">9780691200217</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20202020nju fo d z eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2019052456</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691200217</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691200217</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)544905</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1196361575</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1="0" ind2="0"><subfield code="a">QA9.63</subfield><subfield code="b">.D69 2020</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.63</subfield><subfield code="b">.D69 2021</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Downey, Rod, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Hierarchy of Turing Degrees :</subfield><subfield code="b">A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) /</subfield><subfield code="c">Noam Greenberg, Rod Downey.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (240 p.) :</subfield><subfield code="b">3 b/w illus.</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="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Annals of Mathematics Studies ;</subfield><subfield code="v">382</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">Chapter One. Introduction -- </subfield><subfield code="t">Chapter Two. ɑ-c.a. functions -- </subfield><subfield code="t">Chapter Three. The hierarchy of totally ɑ-c.a. degrees -- </subfield><subfield code="t">Chapter Four. Maximal totally ɑ-c.a. degrees -- </subfield><subfield code="t">Chapter Five. Presentations of left-c.e. reals -- </subfield><subfield code="t">Chapter Six. m-topped degrees -- </subfield><subfield code="t">Chapter Seven. Embeddings of the 1-3-1 lattice -- </subfield><subfield code="t">Chapter Eight. Prompt permissions -- </subfield><subfield code="t">Bibliography</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computable functions.</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">Unsolvability (Mathematical logic)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Unsolvability (Mathematical logic).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursion theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">c.e. degrees.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">c.e. reals.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computable model theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">lattice embeddings.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">m-topped degrees.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mind changes in computability theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">modern computability theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">pi-zero-one classes.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">prompt permissions.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">relative recursive randomness.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">transfinite hierarchy of Turing degrees.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Greenberg, Noam, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2020 English</subfield><subfield code="z">9783110704716</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE COMPLETE 2020</subfield><subfield code="z">9783110704518</subfield><subfield code="o">ZDB-23-DGG</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Mathematics 2020 English</subfield><subfield code="z">9783110704846</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">EBOOK PACKAGE Mathematics 2020</subfield><subfield code="z">9783110704662</subfield><subfield code="o">ZDB-23-DMA</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Annals of Mathematics eBook-Package 1940-2020</subfield><subfield code="z">9783110494914</subfield><subfield code="o">ZDB-23-PMB</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press Complete eBook-Package 2020</subfield><subfield code="z">9783110690088</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691199665</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691200217?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9780691200217</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9780691200217/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-069008-8 Princeton University Press Complete eBook-Package 2020</subfield><subfield code="b">2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-070471-6 EBOOK PACKAGE COMPLETE 2020 English</subfield><subfield code="b">2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-070484-6 EBOOK PACKAGE Mathematics 2020 English</subfield><subfield code="b">2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield><subfield code="b">2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DMA</subfield><subfield code="b">2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PMB</subfield><subfield code="c">1940</subfield><subfield code="d">2020</subfield></datafield></record></collection>

Similar Items