| 000 | 02639cam a2200457Ii 4500 | ||
|---|---|---|---|
| 001 | on1090812743 | ||
| 003 | OCoLC | ||
| 005 | 20241121072738.0 | ||
| 006 | m d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 190329s2019 enk ob 001 0 eng d | ||
| 040 |
_aN$T _beng _erda _epn _cN$T _dN$T |
||
| 020 |
_a9781108271585 _q(electronic bk.) |
||
| 020 |
_a1108271588 _q(electronic bk.) |
||
| 035 |
_a2046158 _b(N$T) |
||
| 035 | _a(OCoLC)1090812743 | ||
| 050 | 4 |
_aQA9.54 _b.K72 2019 |
|
| 072 | 7 |
_aMAT _x000000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.3/6 _223 |
| 049 | _aMAIN | ||
| 100 | 1 |
_aKraj�i�cek, Jan, _eauthor. _911166 |
|
| 245 | 1 | 0 |
_aProof complexity / _cJan Kraj�i�cek. |
| 264 | 1 |
_aCambridge, United Kingdom ; _aNew York, NY, USA : _bCambridge University Press, _c2019. |
|
| 300 | _a1 online resource. | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aEncyclopedia of mathematics and its applications ; _vv. 170 |
|
| 504 | _aIncludes bibliographical references and index. | ||
| 520 | _aProof 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. | ||
| 588 | 0 | _aOnline resource; title from PDF title page (EBSCO, viewed April 2, 2019). | |
| 590 | _aMaster record variable field(s) change: 050, 072, 082, 650 | ||
| 650 | 0 |
_aProof theory. _911167 |
|
| 650 | 0 |
_aComputational complexity. _911168 |
|
| 650 | 7 |
_aMATHEMATICS / General. _2bisacsh _911169 |
|
| 655 | 4 |
_aElectronic books. _93907 |
|
| 830 | 0 |
_aEncyclopedia of mathematics and its applications ; _vv. 170. _911170 |
|
| 856 | 4 | 0 |
_3EBSCOhost _uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2046158 |
| 938 |
_aEBSCOhost _bEBSC _n2046158 |
||
| 994 |
_a92 _bN$T |
||
| 999 |
_c7037 _d7037 |
||