Proof complexity:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2019
|
| Series: | Encyclopedia of mathematics and its applications
170 |
| Subjects: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031823654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Physical Description: | xiv, 516 Seiten |
| ISBN: | 9781108416849 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV046411033 | ||
| 003 | DE-604 | ||
| 005 | 20210416 | ||
| 007 | t| | ||
| 008 | 200206s2019 xxk |||| 00||| eng d | ||
| 010 | |a 018042527 | ||
| 020 | |a 9781108416849 |c hardback |9 978-1-108-41684-9 | ||
| 035 | |a (OCoLC)1143829914 | ||
| 035 | |a (DE-599)BVBBV046411033 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c GB | ||
| 049 | |a DE-11 |a DE-20 | ||
| 050 | 0 | |a QA9.54 | |
| 082 | 0 | |a 511.3/6 |2 23 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 100 | 1 | |a Krajíček, Jan |d 1960- |0 (DE-588)14367630X |4 aut | |
| 245 | 1 | 0 | |a Proof complexity |c Jan Krajíček, Charles University, Prague |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2019 | |
| 300 | |a xiv, 516 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications |v 170 | |
| 650 | 4 | |a Proof theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Beweistheorie |0 (DE-588)4145177-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |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 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-108-24206-6 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications |v 170 |w (DE-604)BV000903719 |9 170 | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031823654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-031823654 | |
Record in the Search Index
| _version_ | 1819249542017581056 |
|---|---|
| adam_text | Contents
Preface page xiii
Acbwwledgements xv
Introduction 1
Parti Basic Concepts 9
1 Concepts and Problems 11
1 1 Propositional Logic 11
1 2 First-Order Logic and Finite Structures 18
1 3 Complexity Classes 22
1 4 Boolean Circuits and Computations 27
1 5 Proof Systems and Fundamental Problems 32
1 6 Bibliographical and Other Remarks 37
2 Frege Systems 39
2 1 Frege Rules and Proofs 39
2 2 Tree-Like Proofs 42
2 3 Reckhow’s Theorem 47
2 4 Extended and Substitution Frege Systems 52
2 5 Overview of Proof Complexity Measures 58
2 6 Bibliographical and Other Remarks 62
3 Sequent Calculus 64
3 1 Sequent Calculus LK 64
3 2 The Strength of LK 66
3 3 Interpolation for Cut-Free Proofs 70
3 4 Constant-Depth Subsystems of LK 73
3 5 Bibliographical and Other Remarks 79
4 Quantified Propositional Calculus 81
4 1 Sequent Calculus G 81
4 2 Relativized Frege systems and Boolean Programs 84
X
Contents
13 6 Games 289
13 7 Bibliographical and Other Remarks 291
14 LKd+i/2 and Combinatorial Restrictions 296
14 1 The Lifting Idea 296
14 2 Restrictions and Switchings 298
14 3 Depth Separation 300
14 4 No-Gap Theorem 302
14 5 DNF Separation 304
14 6 Bibliographical and Other Remarks 304
15 Fa and Logical Restrictions 306
15 1 PHP-Trees and k-Evaluations 307
15 2 The Existence of k-Evaluations 313
15 3 Ajtai’s Theorem 318
15 4 Other Combinatorial Principles 320
15 5 Relations Among Counting Principles 322
15 6 Modular Counting Gates 327
15 7 Bibliographical and Other Remarks 334
16 Algebraic and Geometric Proof Systems 337
16 1 Nullstellensatz 337
16 2 Polynomial Calculus 342
16 3 Positivstellensatz 346
16 4 CP and LS: Rank and Tree-Like Size 348
16 5 Bibliographical and Other Remarks 349
17 Feasible Interpolation: A Framework 353
17 1 The Set-Up 353
17 2 Disjoint NP Pairs Hard to Separate 358
17 3 Win-Win Situation: Non-Automatizability 364
17 4 Communication Protocols 366
17 5 Semantic Feasible Interpolation 370
17 6 Simple Examples 374
17 7 Splitting Proofs 376
17 8 Splitting CNF Formulas 380
17 9 Bibliographical and Other Remarks 380
18 Feasible Interpolation: Applications 384
18 1 CP and Monotone Real Circuits 384
18 2 CP and the Real Game 387
18 3 NS, PC and Span Programs 390
18 4 The Loväsz-Schrijver Proof System 394
18 5 The OBDD Proof System 396
18 6 R(LIN), CP and Randomized Protocols 400
18 7 Limits and Beyond 403
18 8 Bibliographical and Other Remarks 405
Contents xi
Part IV Beyond Bounds 411
19 Hard Tautologies 413
19 1 Levels of Uniformity 414
19 2 Reflection and Consistency 416
19 3 Combinatorics of Consistency 419
19 4 Proof Complexity Generators 426
19 5 Circuit Lower Bounds 432
19 6 Bibliographical and Other Remarks 434
20 Model Theory and Lower Bounds 442
20 1 Short Proofs and Model Extensions 442
20 2 Pseudofinite Structures 447
20 3 Model-Theoretic Forcing 450
20 4 Forcing with Random Variables 452
20 5 Bibliographical and Other Remarks 454
21 Optimality 456
21 1 Hard Sequences 456
21 2 Disjoint NP Pairs 459
21 3 Quantitative Gödel’s Theorem 460
21 4 Diagonalization 463
21 5 The Proof Search Problem 466
21 6 Bibliographical and Other Remarks 468
22 The Nature of Proof Complexity 472
22 1 Algorithmic Level 472
22 2 Combinatorial Level 473
22 3 Logical Level 474
22 4 Mathematical Level 476
22 5 Bibliographical and Other Remarks 477
Bibliography 481
Special Symbols 506
|
| any_adam_object | 1 |
| 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 | BV046411033 |
| 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 |
| ctrlnum | (OCoLC)1143829914 (DE-599)BVBBV046411033 |
| 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 | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01724nam a2200445 cb4500</leader><controlfield tag="001">BV046411033</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210416 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">200206s2019 xxk |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">018042527</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108416849</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-108-41684-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1143829914</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046411033</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="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-20</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><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="100" ind1="1" ind2=" "><subfield code="a">Krajíček, Jan</subfield><subfield code="d">1960-</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 University, Prague</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 516 Seiten</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</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="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">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="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="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-108-24206-6</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)BV000903719</subfield><subfield code="9">170</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031823654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031823654</subfield></datafield></record></collection> |
| id | DE-604.BV046411033 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T18:51:32Z |
| institution | BVB |
| isbn | 9781108416849 |
| language | English |
| lccn | 018042527 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031823654 |
| oclc_num | 1143829914 |
| open_access_boolean | |
| owner | DE-11 DE-20 |
| owner_facet | DE-11 DE-20 |
| physical | xiv, 516 Seiten |
| 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 |
| spellingShingle | Krajíček, Jan 1960- Proof complexity Encyclopedia of mathematics and its applications Proof theory Computational complexity Beweistheorie (DE-588)4145177-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4145177-6 (DE-588)4120591-1 |
| title | Proof complexity |
| title_auth | Proof complexity |
| title_exact_search | Proof complexity |
| title_full | Proof complexity Jan Krajíček, Charles University, Prague |
| title_fullStr | Proof complexity Jan Krajíček, Charles University, Prague |
| title_full_unstemmed | Proof complexity Jan Krajíček, Charles University, Prague |
| title_short | Proof complexity |
| title_sort | proof complexity |
| topic | Proof theory Computational complexity Beweistheorie (DE-588)4145177-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Proof theory Computational complexity Beweistheorie Komplexitätstheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031823654&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000903719 |
| work_keys_str_mv | AT krajicekjan proofcomplexity |