Proof complexity:
"Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, United Kingdom
Cambridge University Press
2019
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications
170 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 TUM01 UBA01 UPA01 Volltext |
| Zusammenfassung: | "Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject"... |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9781108242066 9781108271585 |
| DOI: | 10.1017/9781108242066 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV045920986 | ||
| 003 | DE-604 | ||
| 005 | 20230907 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190607s2019 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108242066 |c Online, PDF |9 978-1-108-24206-6 | ||
| 020 | |a 9781108271585 |c Online |9 978-1-108-27158-5 | ||
| 024 | 7 | |a 10.1017/9781108242066 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108242066 | ||
| 035 | |a (OCoLC)1165495721 | ||
| 035 | |a (DE-599)BVBBV045920986 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-384 |a DE-91 |a DE-739 | ||
| 050 | 0 | |a QA9.54 | |
| 082 | 0 | |a 511.3/6 | |
| 082 | 0 | |a 511.3/6 |2 23 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a MAT 036 |2 stub | ||
| 084 | |a DAT 517 |2 stub | ||
| 100 | 1 | |a Krajíček, Jan |d 1960- |e Verfasser |0 (DE-588)14367630X |4 aut | |
| 245 | 1 | 0 | |a Proof complexity |c Jan Krajíček, Charles Univesity, Prague |
| 264 | 1 | |a Cambridge, United Kingdom |b Cambridge University Press |c 2019 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications |v 170 | |
| 500 | |a Includes bibliographical references and index | ||
| 520 | |a "Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject"... | ||
| 650 | 4 | |a Proof theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-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 Beweistheorie |0 (DE-588)4145177-6 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-1-108-41684-9 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications |v 170 |w (DE-604)BV044777929 |9 170 | |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108242066 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO |a ZDB-30-PQE | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031303474 | ||
| 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.1017/9781108242066 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108242066 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=5745390 |l TUM01 |p ZDB-30-PQE |q TUM_PDA_PQE_Kauf |x Aggregator |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108242066 |l UBA01 |p ZDB-20-CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108242066 |l UPA01 |p ZDB-20-CBO |q UPA_Einzelkauf_2023 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804180099428253696 |
|---|---|
| any_adam_object | |
| author | Krajíček, Jan 1960- |
| author_GND | (DE-588)14367630X |
| author_facet | Krajíček, Jan 1960- |
| author_role | aut |
| author_sort | Krajíček, Jan 1960- |
| author_variant | j k jk |
| building | Verbundindex |
| bvnumber | BV045920986 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.54 |
| callnumber-search | QA9.54 |
| callnumber-sort | QA 19.54 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 |
| classification_tum | MAT 036 DAT 517 |
| collection | ZDB-20-CBO ZDB-30-PQE |
| ctrlnum | (ZDB-20-CBO)CR9781108242066 (OCoLC)1165495721 (DE-599)BVBBV045920986 |
| dewey-full | 511.3/6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/6 |
| dewey-search | 511.3/6 |
| dewey-sort | 3511.3 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/9781108242066 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03556nmm a2200601 cb4500</leader><controlfield tag="001">BV045920986</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230907 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190607s2019 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108242066</subfield><subfield code="c">Online, PDF</subfield><subfield code="9">978-1-108-24206-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108271585</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-27158-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108242066</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108242066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1165495721</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045920986</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.54</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 036</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krajíček, Jan</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)14367630X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof complexity</subfield><subfield code="c">Jan Krajíček, Charles Univesity, Prague</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, United Kingdom</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">170</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject"...</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="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-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">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-1-108-41684-9</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">170</subfield><subfield code="w">(DE-604)BV044777929</subfield><subfield code="9">170</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108242066</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-20-CBO</subfield><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031303474</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.1017/9781108242066</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108242066</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/munchentech/detail.action?docID=5745390</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">TUM_PDA_PQE_Kauf</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108242066</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108242066</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UPA_Einzelkauf_2023</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV045920986 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:30:22Z |
| institution | BVB |
| isbn | 9781108242066 9781108271585 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031303474 |
| oclc_num | 1165495721 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-384 DE-91 DE-BY-TUM DE-739 |
| owner_facet | DE-12 DE-92 DE-384 DE-91 DE-BY-TUM DE-739 |
| physical | 1 Online-Ressource |
| psigel | ZDB-20-CBO ZDB-30-PQE ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-30-PQE TUM_PDA_PQE_Kauf ZDB-20-CBO UPA_Einzelkauf_2023 |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications |
| series2 | Encyclopedia of mathematics and its applications |
| spelling | Krajíček, Jan 1960- Verfasser (DE-588)14367630X aut Proof complexity Jan Krajíček, Charles Univesity, Prague Cambridge, United Kingdom Cambridge University Press 2019 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications 170 Includes bibliographical references and index "Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject"... Proof theory Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Beweistheorie (DE-588)4145177-6 gnd rswk-swf Beweistheorie (DE-588)4145177-6 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Erscheint auch als Druck-Ausgabe, Hardcover 978-1-108-41684-9 Encyclopedia of mathematics and its applications 170 (DE-604)BV044777929 170 https://doi.org/10.1017/9781108242066 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Krajíček, Jan 1960- Proof complexity Encyclopedia of mathematics and its applications Proof theory Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Beweistheorie (DE-588)4145177-6 gnd |
| subject_GND | (DE-588)4120591-1 (DE-588)4145177-6 |
| title | Proof complexity |
| title_auth | Proof complexity |
| title_exact_search | Proof complexity |
| title_full | Proof complexity Jan Krajíček, Charles Univesity, Prague |
| title_fullStr | Proof complexity Jan Krajíček, Charles Univesity, Prague |
| title_full_unstemmed | Proof complexity Jan Krajíček, Charles Univesity, Prague |
| title_short | Proof complexity |
| title_sort | proof complexity |
| topic | Proof theory Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Beweistheorie (DE-588)4145177-6 gnd |
| topic_facet | Proof theory Computational complexity Komplexitätstheorie Beweistheorie |
| url | https://doi.org/10.1017/9781108242066 |
| volume_link | (DE-604)BV044777929 |
| work_keys_str_mv | AT krajicekjan proofcomplexity |