Provability, complexity, grammars:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Providence, RI
American Mathematical Society
1999
|
Schlagworte: | |
Online-Zugang: | UBM01 URL des Erstveröffentlichers |
Beschreibung: | Contains three doctoral dissertations in mathematical logic, mathematical linguistics, and complexity theory, translated from the Russian. - Mode of access : World Wide Web |
Beschreibung: | 1 online resource (ix, 172 p. ill.) |
ISBN: | 9781470434038 |
DOI: | 10.1090/trans2/192 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV044238108 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 170323s1999 |||| o||u| ||||||eng d | ||
020 | |a 9781470434038 |c online |9 978-1-4704-3403-8 | ||
024 | 7 | |a 10.1090/trans2/192 |2 doi | |
035 | |a (ZDB-138-AMT)3102770 | ||
035 | |a (OCoLC)979538610 | ||
035 | |a (DE-599)BVBBV044238108 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-19 | ||
082 | 0 | |a 510 s |2 21 | |
084 | |a SI 160 |0 (DE-625)143084: |2 rvk | ||
100 | 1 | |a Beklemishev, Lev Dmitrievich |d 1967- |e Verfasser |4 aut | |
245 | 1 | 0 | |a Provability, complexity, grammars |c Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin |
264 | 1 | |a Providence, RI |b American Mathematical Society |c 1999 | |
300 | |a 1 online resource (ix, 172 p. |b ill.) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Contains three doctoral dissertations in mathematical logic, mathematical linguistics, and complexity theory, translated from the Russian. - Mode of access : World Wide Web | ||
505 | 8 | |a Includes bibliographical references | |
650 | 4 | |a Modality (Logic) | |
650 | 4 | |a Proof theory | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Mathematical linguistics | |
650 | 0 | 7 | |a Modalität |0 (DE-588)4039789-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mathematische Linguistik |0 (DE-588)4037950-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Beweistheorie |0 (DE-588)4145177-6 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Modalität |0 (DE-588)4039789-0 |D s |
689 | 0 | 1 | |a Beweistheorie |0 (DE-588)4145177-6 |D s |
689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | 3 | |a Mathematische Linguistik |0 (DE-588)4037950-4 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Pentus, Mati Reĭnovich |d 1967- |e Sonstige |4 oth | |
700 | 1 | |a Vereshchagin, Nikolai Konstantinovich |d 1958- |e Sonstige |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Beklemishev, Lev Dmitrievich, 1967- |t Provability, complexity, grammars |z 9780821810781 |
856 | 4 | 0 | |u https://doi.org/10.1090/trans2/192 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-138-AMT | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029643532 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1090/trans2/192 |l UBM01 |p ZDB-138-AMT |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804177397009874944 |
---|---|
any_adam_object | |
author | Beklemishev, Lev Dmitrievich 1967- |
author_facet | Beklemishev, Lev Dmitrievich 1967- |
author_role | aut |
author_sort | Beklemishev, Lev Dmitrievich 1967- |
author_variant | l d b ld ldb |
building | Verbundindex |
bvnumber | BV044238108 |
classification_rvk | SI 160 |
collection | ZDB-138-AMT |
contents | Includes bibliographical references |
ctrlnum | (ZDB-138-AMT)3102770 (OCoLC)979538610 (DE-599)BVBBV044238108 |
dewey-full | 510S |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 510 - Mathematics |
dewey-raw | 510 s |
dewey-search | 510 s |
dewey-sort | 3510 S |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1090/trans2/192 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02457nmm a2200565zc 4500</leader><controlfield tag="001">BV044238108</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170323s1999 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781470434038</subfield><subfield code="c">online</subfield><subfield code="9">978-1-4704-3403-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1090/trans2/192</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-138-AMT)3102770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979538610</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044238108</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510 s</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 160</subfield><subfield code="0">(DE-625)143084:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beklemishev, Lev Dmitrievich</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Provability, complexity, grammars</subfield><subfield code="c">Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, RI</subfield><subfield code="b">American Mathematical Society</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (ix, 172 p.</subfield><subfield code="b">ill.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Contains three doctoral dissertations in mathematical logic, mathematical linguistics, and complexity theory, translated from the Russian. - Mode of access : World Wide Web</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Modality (Logic)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical linguistics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modalität</subfield><subfield code="0">(DE-588)4039789-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Linguistik</subfield><subfield code="0">(DE-588)4037950-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Modalität</subfield><subfield code="0">(DE-588)4039789-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Mathematische Linguistik</subfield><subfield code="0">(DE-588)4037950-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pentus, Mati Reĭnovich</subfield><subfield code="d">1967-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vereshchagin, Nikolai Konstantinovich</subfield><subfield code="d">1958-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Beklemishev, Lev Dmitrievich, 1967-</subfield><subfield code="t">Provability, complexity, grammars</subfield><subfield code="z">9780821810781</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1090/trans2/192</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-138-AMT</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029643532</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1090/trans2/192</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-138-AMT</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV044238108 |
illustrated | Illustrated |
indexdate | 2024-07-10T07:47:25Z |
institution | BVB |
isbn | 9781470434038 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029643532 |
oclc_num | 979538610 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM |
owner_facet | DE-19 DE-BY-UBM |
physical | 1 online resource (ix, 172 p. ill.) |
psigel | ZDB-138-AMT |
publishDate | 1999 |
publishDateSearch | 1999 |
publishDateSort | 1999 |
publisher | American Mathematical Society |
record_format | marc |
spelling | Beklemishev, Lev Dmitrievich 1967- Verfasser aut Provability, complexity, grammars Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin Providence, RI American Mathematical Society 1999 1 online resource (ix, 172 p. ill.) txt rdacontent c rdamedia cr rdacarrier Contains three doctoral dissertations in mathematical logic, mathematical linguistics, and complexity theory, translated from the Russian. - Mode of access : World Wide Web Includes bibliographical references Modality (Logic) Proof theory Computational complexity Mathematical linguistics Modalität (DE-588)4039789-0 gnd rswk-swf Mathematische Linguistik (DE-588)4037950-4 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Beweistheorie (DE-588)4145177-6 gnd rswk-swf Modalität (DE-588)4039789-0 s Beweistheorie (DE-588)4145177-6 s Berechnungskomplexität (DE-588)4134751-1 s Mathematische Linguistik (DE-588)4037950-4 s 1\p DE-604 Pentus, Mati Reĭnovich 1967- Sonstige oth Vereshchagin, Nikolai Konstantinovich 1958- Sonstige oth Erscheint auch als Druck-Ausgabe Beklemishev, Lev Dmitrievich, 1967- Provability, complexity, grammars 9780821810781 https://doi.org/10.1090/trans2/192 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Beklemishev, Lev Dmitrievich 1967- Provability, complexity, grammars Includes bibliographical references Modality (Logic) Proof theory Computational complexity Mathematical linguistics Modalität (DE-588)4039789-0 gnd Mathematische Linguistik (DE-588)4037950-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Beweistheorie (DE-588)4145177-6 gnd |
subject_GND | (DE-588)4039789-0 (DE-588)4037950-4 (DE-588)4134751-1 (DE-588)4145177-6 |
title | Provability, complexity, grammars |
title_auth | Provability, complexity, grammars |
title_exact_search | Provability, complexity, grammars |
title_full | Provability, complexity, grammars Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin |
title_fullStr | Provability, complexity, grammars Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin |
title_full_unstemmed | Provability, complexity, grammars Lev Beklemishev, Mati Pentus, Nikolai Vereshchagin |
title_short | Provability, complexity, grammars |
title_sort | provability complexity grammars |
topic | Modality (Logic) Proof theory Computational complexity Mathematical linguistics Modalität (DE-588)4039789-0 gnd Mathematische Linguistik (DE-588)4037950-4 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Beweistheorie (DE-588)4145177-6 gnd |
topic_facet | Modality (Logic) Proof theory Computational complexity Mathematical linguistics Modalität Mathematische Linguistik Berechnungskomplexität Beweistheorie |
url | https://doi.org/10.1090/trans2/192 |
work_keys_str_mv | AT beklemishevlevdmitrievich provabilitycomplexitygrammars AT pentusmatireinovich provabilitycomplexitygrammars AT vereshchaginnikolaikonstantinovich provabilitycomplexitygrammars |