|
|
|
|
LEADER |
00000cam a2200000Mu 4500 |
001 |
EBOOKCENTRAL_ocn654029369 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n|---||||| |
008 |
100809s2010 ne o 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d MHW
|d IDEBK
|d OCLCQ
|d DEBSZ
|d OCLCQ
|d ZCU
|d OCLCQ
|d MERUC
|d ICG
|d OCLCO
|d OCLCF
|d OCLCQ
|d OCLCO
|d OCLCQ
|d DKC
|d UMR
|d AU@
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 667095952
|
020 |
|
|
|a 9780511679674
|
020 |
|
|
|a 051167967X
|
029 |
1 |
|
|a DEBBG
|b BV044142798
|
029 |
1 |
|
|a DEBSZ
|b 379314576
|
029 |
1 |
|
|a DKDLA
|b 820120-katalog:999928470005765
|
035 |
|
|
|a (OCoLC)654029369
|z (OCoLC)667095952
|
050 |
|
4 |
|a QA267.7.C695 2010
|
082 |
0 |
4 |
|a 511.36
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Cook, Stephen,
|d 1948-
|1 https://id.oclc.org/worldcat/entity/E39PCjFp7RdW6qKG6fYDdm8PkP
|
245 |
1 |
0 |
|a Logical Foundations of Proof Complexity.
|
260 |
|
|
|a Leiden :
|b Cambridge University Press,
|c 2010.
|
300 |
|
|
|a 1 online resource (497 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
505 |
0 |
|
|a Cover; Half-title; Series-title; Title; Copyright; CONTENTS; PREFACE; Chapter I: INTRODUCTION; Chapter II: THE PREDICATE CALCULUS AND THE SYSTEM LK; Chapter III: PEANO ARITHMETIC AND ITS SUBSYSTEMS; Chapter IV: TWO-SORTED LOGIC AND COMPLEXITY CLASSES; Chapter V: THE THEORY V0 AND AC0; Chapter VI: THE THEORY V1 AND POLYNOMIAL TIME; Chapter VII: PROPOSITIONAL TRANSLATIONS; Chapter VIII: THEORIES FOR POLYNOMIAL TIME AND BEYOND; Chapter IX: THEORIES FOR SMALL CLASSES; Chapter X: PROOF SYSTEMS AND THE REFLECTION PRINCIPLE; Appendix A: COMPUTATION MODELS; BIBLIOGRAPHY; INDEX.
|
520 |
|
|
|a A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Computational complexity.
|
650 |
|
0 |
|a Proof theory.
|
650 |
|
0 |
|a Logic, Symbolic and mathematical.
|
650 |
|
6 |
|a Complexité de calcul (Informatique)
|
650 |
|
6 |
|a Théorie de la preuve.
|
650 |
|
6 |
|a Logique symbolique et mathématique.
|
650 |
|
7 |
|a Computational complexity
|2 fast
|
650 |
|
7 |
|a Logic, Symbolic and mathematical
|2 fast
|
650 |
|
7 |
|a Proof theory
|2 fast
|
700 |
1 |
|
|a Nguyen, Phuong,
|d 1977-
|1 https://id.oclc.org/worldcat/entity/E39PCjxMHYjCqdTffDJxgvrxym
|
758 |
|
|
|i has work:
|a Logical foundations of proof complexity (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGJyyqcPbF6KXrQxmjTyV3
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
776 |
0 |
8 |
|i Print version:
|a Cook, Stephen.
|t Logical Foundations of Proof Complexity.
|d Leiden : Cambridge University Press, ©2010
|z 9780521517294
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=501328
|z Texto completo
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL501328
|
938 |
|
|
|a ProQuest MyiLibrary Digital eBook Collection
|b IDEB
|n 253611
|
994 |
|
|
|a 92
|b IZTAP
|