Theory of Formal Systems. (AM-47), Volume 47 / / Raymond M. Smullyan.
This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.
Saved in:
| Superior document: | Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2016] ©1961 |
| Year of Publication: | 2016 |
| Language: | English |
| Series: | Annals of Mathematics Studies ;
47 |
| Online Access: | |
| Physical Description: | 1 online resource (156 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
9781400882007 |
|---|---|
| ctrlnum |
(DE-B1597)467917 (OCoLC)979728674 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Smullyan, Raymond M., author. aut http://id.loc.gov/vocabulary/relators/aut Theory of Formal Systems. (AM-47), Volume 47 / Raymond M. Smullyan. Princeton, NJ : Princeton University Press, [2016] ©1961 1 online resource (156 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Annals of Mathematics Studies ; 47 Frontmatter -- TABLE OF CONTENTS -- PREFACE -- ANNALS OF MATHEMATICS STUDIES -- CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- CHAPTER IV: RECURSIVE FUNCTION THEORY -- CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- REFERENCE AND BRIEF BIBLIOGRAPHY restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems. 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 27. Jan 2023) Logic, Symbolic and mathematical. Mathematics. Recursive functions. SCIENCE / System Theory. bisacsh Addition. Algebraic geometry. Alonzo Church. Arithmetic function. Arithmetic. Atomic sentence. Axiom A. Axiom schema. Axiom. Axiomatic system. Binary relation. Cantor's diagonal argument. Cartesian product. Characterization (mathematics). Chinese remainder theorem. Closed-form expression. Closure (mathematics). Combination. Combinatory logic. Complement (set theory). Concatenation theory. Consistency. Constructive proof. Corollary. Countable set. Counterexample. Decidability (logic). Decision problem. Definable set. Diagonalization. Direct proof. Disjoint sets. Enumeration. Equation. Existential quantification. Exponential function. Finite set. Formal system. Functional calculus. Gödel numbering. Gödel's incompleteness theorems. Herbrand's theorem. Inference. Integer factorization. Iteration. John Myhill. Logical connective. Logical consequence. Mathematical induction. Mathematical logic. Mathematician. Metamathematics. Modus ponens. Natural number. Negation. Number theory. Order theory. Parity (mathematics). Peano axioms. Predicate (mathematical logic). Prenex normal form. Primitive recursive function. Quantifier (logic). Recursion. Recursive set. Recursively enumerable set. Remainder. Requirement. Rule of inference. Scientific notation. Sequence. Set (mathematics). Sign (mathematics). Special case. Subset. Suggestion. System U. Theorem. Theory. Transfinite number. Turing machine. Universal set. Validity. Variable (mathematics). Zermelo set theory. 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 eBook-Package Archive 1927-1999 9783110442496 print 9780691080475 https://doi.org/10.1515/9781400882007 https://www.degruyter.com/isbn/9781400882007 Cover https://www.degruyter.com/document/cover/isbn/9781400882007/original |
| language |
English |
| format |
eBook |
| author |
Smullyan, Raymond M., Smullyan, Raymond M., |
| spellingShingle |
Smullyan, Raymond M., Smullyan, Raymond M., Theory of Formal Systems. (AM-47), Volume 47 / Annals of Mathematics Studies ; Frontmatter -- TABLE OF CONTENTS -- PREFACE -- ANNALS OF MATHEMATICS STUDIES -- CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- CHAPTER IV: RECURSIVE FUNCTION THEORY -- CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- REFERENCE AND BRIEF BIBLIOGRAPHY |
| author_facet |
Smullyan, Raymond M., Smullyan, Raymond M., |
| author_variant |
r m s rm rms r m s rm rms |
| author_role |
VerfasserIn VerfasserIn |
| author_sort |
Smullyan, Raymond M., |
| title |
Theory of Formal Systems. (AM-47), Volume 47 / |
| title_full |
Theory of Formal Systems. (AM-47), Volume 47 / Raymond M. Smullyan. |
| title_fullStr |
Theory of Formal Systems. (AM-47), Volume 47 / Raymond M. Smullyan. |
| title_full_unstemmed |
Theory of Formal Systems. (AM-47), Volume 47 / Raymond M. Smullyan. |
| title_auth |
Theory of Formal Systems. (AM-47), Volume 47 / |
| title_alt |
Frontmatter -- TABLE OF CONTENTS -- PREFACE -- ANNALS OF MATHEMATICS STUDIES -- CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- CHAPTER IV: RECURSIVE FUNCTION THEORY -- CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- REFERENCE AND BRIEF BIBLIOGRAPHY |
| title_new |
Theory of Formal Systems. (AM-47), Volume 47 / |
| title_sort |
theory of formal systems. (am-47), volume 47 / |
| series |
Annals of Mathematics Studies ; |
| series2 |
Annals of Mathematics Studies ; |
| publisher |
Princeton University Press, |
| publishDate |
2016 |
| physical |
1 online resource (156 p.) |
| contents |
Frontmatter -- TABLE OF CONTENTS -- PREFACE -- ANNALS OF MATHEMATICS STUDIES -- CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- CHAPTER IV: RECURSIVE FUNCTION THEORY -- CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- REFERENCE AND BRIEF BIBLIOGRAPHY |
| isbn |
9781400882007 9783110494914 9783110442496 9780691080475 |
| callnumber-first |
Q - Science |
| callnumber-subject |
QA - Mathematics |
| callnumber-label |
QA248 |
| callnumber-sort |
QA 3248.5 |
| url |
https://doi.org/10.1515/9781400882007 https://www.degruyter.com/isbn/9781400882007 https://www.degruyter.com/document/cover/isbn/9781400882007/original |
| illustrated |
Not Illustrated |
| dewey-hundreds |
500 - Science |
| dewey-tens |
510 - Mathematics |
| dewey-ones |
511 - General principles of mathematics |
| dewey-full |
511.33 |
| dewey-sort |
3511.33 |
| dewey-raw |
511.33 |
| dewey-search |
511.33 |
| doi_str_mv |
10.1515/9781400882007 |
| oclc_num |
979728674 |
| work_keys_str_mv |
AT smullyanraymondm theoryofformalsystemsam47volume47 |
| status_str |
n |
| ids_txt_mv |
(DE-B1597)467917 (OCoLC)979728674 |
| carrierType_str_mv |
cr |
| hierarchy_parent_title |
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 eBook-Package Archive 1927-1999 |
| is_hierarchy_title |
Theory of Formal Systems. (AM-47), Volume 47 / |
| container_title |
Title is part of eBook package: De Gruyter Princeton Annals of Mathematics eBook-Package 1940-2020 |
| _version_ |
1806143645094510592 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06181nam a22017655i 4500</leader><controlfield tag="001">9781400882007</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230127011820.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230127t20161961nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400882007</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400882007</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)467917</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979728674</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=" " ind2="4"><subfield code="a">QA248.5</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">SCI064000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.33</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="q">SEPA</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/17610:</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Smullyan, Raymond M., </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="0"><subfield code="a">Theory of Formal Systems. (AM-47), Volume 47 /</subfield><subfield code="c">Raymond M. Smullyan.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1961</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (156 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">Annals of Mathematics Studies ;</subfield><subfield code="v">47</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">TABLE OF CONTENTS -- </subfield><subfield code="t">PREFACE -- </subfield><subfield code="t">ANNALS OF MATHEMATICS STUDIES -- </subfield><subfield code="t">CHAPTER I: FORMAL MATHEMATICAL SYSTEMS -- </subfield><subfield code="t">CHAPTER II: FORMAL REPRESENTABILITY AND RECURSIVE ENUMERABILITY -- </subfield><subfield code="t">CHAPTER III: INCOMPLETENESS -AND UNDECIDABILITY -- </subfield><subfield code="t">CHAPTER IV: RECURSIVE FUNCTION THEORY -- </subfield><subfield code="t">CHAPTER V: CREATIVITY AND EFFECTIVE INSEPARABILITY -- </subfield><subfield code="t">SUPPLEMENT: APPLICATIONS TO MATHEMATICAL LOGIC -- </subfield><subfield code="t">REFERENCE AND BRIEF 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">This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.</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 27. Jan 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursive functions.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">SCIENCE / System Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Addition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic geometry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Alonzo Church.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Arithmetic function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Arithmetic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Atomic sentence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Axiom A.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Axiom schema.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Axiom.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Axiomatic system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Binary relation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cantor's diagonal argument.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cartesian product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Characterization (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chinese remainder theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Closed-form expression.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Closure (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combination.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatory logic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complement (set theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Concatenation theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Consistency.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Constructive proof.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Corollary.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Countable set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Counterexample.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Decidability (logic).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Decision problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Definable set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Diagonalization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Direct proof.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Disjoint sets.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Enumeration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Equation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Existential quantification.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Exponential function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Finite set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Formal system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Functional calculus.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gödel numbering.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Gödel's incompleteness theorems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Herbrand's theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Inference.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Integer factorization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iteration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">John Myhill.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Logical connective.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Logical consequence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical induction.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical logic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematician.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Metamathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Modus ponens.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Natural number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Negation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Number theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Order theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parity (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Peano axioms.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Predicate (mathematical logic).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Prenex normal form.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Primitive recursive function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantifier (logic).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursion.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursive set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Recursively enumerable set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Remainder.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Requirement.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Rule of inference.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Scientific notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sequence.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Set (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sign (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Special case.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Subset.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Suggestion.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">System U.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Transfinite number.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Turing machine.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Universal set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Validity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Zermelo set theory.</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 eBook-Package Archive 1927-1999</subfield><subfield code="z">9783110442496</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691080475</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400882007</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400882007</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400882007/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="c">1927</subfield><subfield code="d">1999</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_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_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-PMB</subfield><subfield code="c">1940</subfield><subfield code="d">2020</subfield></datafield></record></collection> |