Recursion Theory and Complexity : : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / / ed. by Marat M. Arslanov, Steffen Lempp.
Saved in:
Superior document: | Title is part of eBook package: De Gruyter DGBA Mathematics - 1990 - 1999 |
---|---|
HerausgeberIn: | |
MitwirkendeR: | |
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2014] ©1999 |
Year of Publication: | 2014 |
Edition: | Reprint 2014 |
Language: | English |
Series: | De Gruyter Series in Logic and Its Applications ,
2 |
Online Access: | |
Physical Description: | 1 online resource (239 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9783110807486 |
---|---|
ctrlnum |
(DE-B1597)43081 (OCoLC)922696043 |
collection |
bib_alma |
record_format |
marc |
spelling |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / ed. by Marat M. Arslanov, Steffen Lempp. Reprint 2014 Berlin ; Boston : De Gruyter, [2014] ©1999 1 online resource (239 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda De Gruyter Series in Logic and Its Applications , 1438-1893 ; 2 Frontmatter -- Preface -- Table of contents -- Priority method in generalized computability -- Polynomial-time versus computable Boolean algebras -- The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders -- Effectively nowhere simple relations on computable structures -- Jump traces with large gaps -- Weak recursive degrees and a problem of Spector -- Compositions of permutations and algorithmic reducibilities -- Some properties of majorant-computability -- Hyperarithmetical functions and algebraicity -- Weak presentations of fields not extendible to recursive presentations -- Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees -- Enumeration reducibility and the problem of the nontotal property of e-degrees -- Algebras of recursive functions -- Σ2 Induction and cuppable degrees -- Open problems -- List of talks -- List of contributors -- Backmatter restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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 28. Feb 2023) Computational complexity Congresses. Recursion theory Congresses. Berechnungskomplexität. Rekursionstheorie. MATHEMATICS / General. bisacsh Arslanov, Marat M., editor. edt http://id.loc.gov/vocabulary/relators/edt Ashaev, Igor V., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Cenzer, Douglas, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Downey, Rodney G., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Harizanov, Valentina S., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Hinman, Peter G., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Ishmukhametov, Shamil, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Korovin, Κ. V., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Korovina, M. V., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Kudinov, Ο. V., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Lempp, Steffen, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Lempp, Steffen, editor. edt http://id.loc.gov/vocabulary/relators/edt Morozov, A. S., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Remmel, Jeffrey B., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Shlapentokh, Alexandra, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Shore, Richard, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Solon, Boris, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Solovyev, V., contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Sorbi, Andrea, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Yang, Yue, contributor. ctb https://id.loc.gov/vocabulary/relators/ctb Title is part of eBook package: De Gruyter DGBA Mathematics - 1990 - 1999 9783110637199 ZDB-23-GMA print 9783110165876 https://doi.org/10.1515/9783110807486 https://www.degruyter.com/isbn/9783110807486 Cover https://www.degruyter.com/document/cover/isbn/9783110807486/original |
language |
English |
format |
eBook |
author2 |
Arslanov, Marat M., Arslanov, Marat M., Ashaev, Igor V., Ashaev, Igor V., Cenzer, Douglas, Cenzer, Douglas, Downey, Rodney G., Downey, Rodney G., Harizanov, Valentina S., Harizanov, Valentina S., Hinman, Peter G., Hinman, Peter G., Ishmukhametov, Shamil, Ishmukhametov, Shamil, Korovin, Κ. V., Korovin, Κ. V., Korovina, M. V., Korovina, M. V., Kudinov, Ο. V., Kudinov, Ο. V., Lempp, Steffen, Lempp, Steffen, Lempp, Steffen, Lempp, Steffen, Morozov, A. S., Morozov, A. S., Remmel, Jeffrey B., Remmel, Jeffrey B., Shlapentokh, Alexandra, Shlapentokh, Alexandra, Shore, Richard, Shore, Richard, Solon, Boris, Solon, Boris, Solovyev, V., Solovyev, V., Sorbi, Andrea, Sorbi, Andrea, Yang, Yue, Yang, Yue, |
author_facet |
Arslanov, Marat M., Arslanov, Marat M., Ashaev, Igor V., Ashaev, Igor V., Cenzer, Douglas, Cenzer, Douglas, Downey, Rodney G., Downey, Rodney G., Harizanov, Valentina S., Harizanov, Valentina S., Hinman, Peter G., Hinman, Peter G., Ishmukhametov, Shamil, Ishmukhametov, Shamil, Korovin, Κ. V., Korovin, Κ. V., Korovina, M. V., Korovina, M. V., Kudinov, Ο. V., Kudinov, Ο. V., Lempp, Steffen, Lempp, Steffen, Lempp, Steffen, Lempp, Steffen, Morozov, A. S., Morozov, A. S., Remmel, Jeffrey B., Remmel, Jeffrey B., Shlapentokh, Alexandra, Shlapentokh, Alexandra, Shore, Richard, Shore, Richard, Solon, Boris, Solon, Boris, Solovyev, V., Solovyev, V., Sorbi, Andrea, Sorbi, Andrea, Yang, Yue, Yang, Yue, |
author2_variant |
m m a mm mma m m a mm mma i v a iv iva i v a iv iva d c dc d c dc r g d rg rgd r g d rg rgd v s h vs vsh v s h vs vsh p g h pg pgh p g h pg pgh s i si s i si κ v k κv κvk κ v k κv κvk m v k mv mvk m v k mv mvk ο v k οv οvk ο v k οv οvk s l sl s l sl s l sl s l sl a s m as asm a s m as asm j b r jb jbr j b r jb jbr a s as a s as r s rs r s rs b s bs b s bs v s vs v s vs a s as a s as y y yy y y yy |
author2_role |
HerausgeberIn HerausgeberIn MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR HerausgeberIn HerausgeberIn MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR MitwirkendeR |
author_sort |
Arslanov, Marat M., |
title |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / |
spellingShingle |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / De Gruyter Series in Logic and Its Applications , Frontmatter -- Preface -- Table of contents -- Priority method in generalized computability -- Polynomial-time versus computable Boolean algebras -- The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders -- Effectively nowhere simple relations on computable structures -- Jump traces with large gaps -- Weak recursive degrees and a problem of Spector -- Compositions of permutations and algorithmic reducibilities -- Some properties of majorant-computability -- Hyperarithmetical functions and algebraicity -- Weak presentations of fields not extendible to recursive presentations -- Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees -- Enumeration reducibility and the problem of the nontotal property of e-degrees -- Algebras of recursive functions -- Σ2 Induction and cuppable degrees -- Open problems -- List of talks -- List of contributors -- Backmatter |
title_sub |
Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / |
title_full |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / ed. by Marat M. Arslanov, Steffen Lempp. |
title_fullStr |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / ed. by Marat M. Arslanov, Steffen Lempp. |
title_full_unstemmed |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / ed. by Marat M. Arslanov, Steffen Lempp. |
title_auth |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / |
title_alt |
Frontmatter -- Preface -- Table of contents -- Priority method in generalized computability -- Polynomial-time versus computable Boolean algebras -- The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders -- Effectively nowhere simple relations on computable structures -- Jump traces with large gaps -- Weak recursive degrees and a problem of Spector -- Compositions of permutations and algorithmic reducibilities -- Some properties of majorant-computability -- Hyperarithmetical functions and algebraicity -- Weak presentations of fields not extendible to recursive presentations -- Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees -- Enumeration reducibility and the problem of the nontotal property of e-degrees -- Algebras of recursive functions -- Σ2 Induction and cuppable degrees -- Open problems -- List of talks -- List of contributors -- Backmatter |
title_new |
Recursion Theory and Complexity : |
title_sort |
recursion theory and complexity : proceedings of the kazan '97 workshop, kazan, russia, july 14–19, 1997 / |
series |
De Gruyter Series in Logic and Its Applications , |
series2 |
De Gruyter Series in Logic and Its Applications , |
publisher |
De Gruyter, |
publishDate |
2014 |
physical |
1 online resource (239 p.) Issued also in print. |
edition |
Reprint 2014 |
contents |
Frontmatter -- Preface -- Table of contents -- Priority method in generalized computability -- Polynomial-time versus computable Boolean algebras -- The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders -- Effectively nowhere simple relations on computable structures -- Jump traces with large gaps -- Weak recursive degrees and a problem of Spector -- Compositions of permutations and algorithmic reducibilities -- Some properties of majorant-computability -- Hyperarithmetical functions and algebraicity -- Weak presentations of fields not extendible to recursive presentations -- Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees -- Enumeration reducibility and the problem of the nontotal property of e-degrees -- Algebras of recursive functions -- Σ2 Induction and cuppable degrees -- Open problems -- List of talks -- List of contributors -- Backmatter |
isbn |
9783110807486 9783110637199 9783110165876 |
issn |
1438-1893 ; |
genre_facet |
Congresses. |
url |
https://doi.org/10.1515/9783110807486 https://www.degruyter.com/isbn/9783110807486 https://www.degruyter.com/document/cover/isbn/9783110807486/original |
illustrated |
Not Illustrated |
doi_str_mv |
10.1515/9783110807486 |
oclc_num |
922696043 |
work_keys_str_mv |
AT arslanovmaratm recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT ashaevigorv recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT cenzerdouglas recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT downeyrodneyg recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT harizanovvalentinas recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT hinmanpeterg recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT ishmukhametovshamil recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT korovinkv recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT korovinamv recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT kudinovov recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT lemppsteffen recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT morozovas recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT remmeljeffreyb recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT shlapentokhalexandra recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT shorerichard recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT solonboris recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT solovyevv recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT sorbiandrea recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 AT yangyue recursiontheoryandcomplexityproceedingsofthekazan97workshopkazanrussiajuly14191997 |
status_str |
n |
ids_txt_mv |
(DE-B1597)43081 (OCoLC)922696043 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter DGBA Mathematics - 1990 - 1999 |
is_hierarchy_title |
Recursion Theory and Complexity : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / |
container_title |
Title is part of eBook package: De Gruyter DGBA Mathematics - 1990 - 1999 |
author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField noLinkedField |
_version_ |
1770177840266870784 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05637nam a22010335i 4500</leader><controlfield tag="001">9783110807486</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230228015514.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230228t20141999gw fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1013948999</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1029833010</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1032683317</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1037979808</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1041993875</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1046614029</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1046684800</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1047015124</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110807486</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110807486</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)43081</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)922696043</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">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 1997</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/142731:</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Recursion Theory and Complexity :</subfield><subfield code="b">Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 /</subfield><subfield code="c">ed. by Marat M. Arslanov, Steffen Lempp.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Reprint 2014</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ;</subfield><subfield code="a">Boston : </subfield><subfield code="b">De Gruyter, </subfield><subfield code="c">[2014]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (239 p.)</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">De Gruyter Series in Logic and Its Applications ,</subfield><subfield code="x">1438-1893 ;</subfield><subfield code="v">2</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Table of contents -- </subfield><subfield code="t">Priority method in generalized computability -- </subfield><subfield code="t">Polynomial-time versus computable Boolean algebras -- </subfield><subfield code="t">The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders -- </subfield><subfield code="t">Effectively nowhere simple relations on computable structures -- </subfield><subfield code="t">Jump traces with large gaps -- </subfield><subfield code="t">Weak recursive degrees and a problem of Spector -- </subfield><subfield code="t">Compositions of permutations and algorithmic reducibilities -- </subfield><subfield code="t">Some properties of majorant-computability -- </subfield><subfield code="t">Hyperarithmetical functions and algebraicity -- </subfield><subfield code="t">Weak presentations of fields not extendible to recursive presentations -- </subfield><subfield code="t">Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees -- </subfield><subfield code="t">Enumeration reducibility and the problem of the nontotal property of e-degrees -- </subfield><subfield code="t">Algebras of recursive functions -- </subfield><subfield code="t">Σ2 Induction and cuppable degrees -- </subfield><subfield code="t">Open problems -- </subfield><subfield code="t">List of talks -- </subfield><subfield code="t">List of contributors -- </subfield><subfield code="t">Backmatter</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="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 28. Feb 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursion theory</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Berechnungskomplexität.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rekursionstheorie.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Arslanov, Marat M., </subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ashaev, Igor V., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cenzer, Douglas, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Downey, Rodney G., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Harizanov, Valentina S., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hinman, Peter G., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ishmukhametov, Shamil, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Korovin, Κ. V., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Korovina, M. V., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kudinov, Ο. V., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lempp, Steffen, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lempp, Steffen, </subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Morozov, A. S., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Remmel, Jeffrey B., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shlapentokh, Alexandra, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shore, Richard, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solon, Boris, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solovyev, V., </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sorbi, Andrea, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Yue, </subfield><subfield code="e">contributor.</subfield><subfield code="4">ctb</subfield><subfield code="4">https://id.loc.gov/vocabulary/relators/ctb</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">DGBA Mathematics - 1990 - 1999</subfield><subfield code="z">9783110637199</subfield><subfield code="o">ZDB-23-GMA</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9783110165876</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110807486</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9783110807486</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9783110807486/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</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_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-GMA</subfield><subfield code="c">1990</subfield><subfield code="d">1999</subfield></datafield></record></collection> |