Proof complexity / (Record no. 58732)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02331cam a2200241 i 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 180913s2019 enk b 001 0 eng c |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781108416849 (HB) |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER | |
| Universal Decimal Classification number | 51 |
| Item number | KRA |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Krajicek, Jan, |
| 245 10 - TITLE STATEMENT | |
| Title | Proof complexity / |
| Sub Title | Charles University, Prague. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Cambridge |
| Name of publisher | Cambridge University Press |
| Year of publication | 2019 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xiv, 516 p |
| 490 0# - SERIES STATEMENT | |
| Series statement | Encyclopedia of mathematics and its applications ; |
| Volume number/sequential designation | 170 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Concepts and problems -- Frege systems -- Sequent calculus -- Quantifed propositional calculus -- Resolution -- Algebraic and geometric proof systems -- Further proof systems -- Basic example of the correspondence -- Two worlds of bounded arithmetic -- Up to EF via the <...> translation -- Examples of upper bounds and p-simulations -- Beyond EF via the || ... || translation -- R and R-like proof systems -- LKD+1/2 and combinatorial restrictions -- Fd and logical restrictions -- Algebraic and geometric proof systems -- Feasible interpolation: a framework -- Feasible interpolation: applications -- Hard tautologies -- Model theory and lower bounds -- Optimality -- The nature of proof complexity. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | "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"-- |
| 546 ## - LANGUAGE NOTE | |
| Language note | eng |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Proof theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computational complexity. |
| 690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) | |
| Topical term or geographic name as entry element | Mathematics |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | BOOKS |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Shelving location | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|
| IMSc Library | First Floor, Rack No: 26, Shelf No: 24 | 51 KRA | 75848 | BOOKS |