Proof Complexity
(Sprache: Englisch)
Offers a self-contained work presenting basic ideas, classical results, current state of the art and possible future directions in proof complexity.
Leider schon ausverkauft
versandkostenfrei
Buch
Fr. 217.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Proof Complexity “
Klappentext zu „Proof Complexity “
Offers a self-contained work presenting basic ideas, classical results, current state of the art and possible future directions in proof complexity.
Inhaltsverzeichnis zu „Proof Complexity “
Introduction; Part I. Basic Concepts: 1. Concepts and problems; 2. Frege systems; 3. Sequent calculus; 4. Quantified propositional calculus; 5. Resolution; 6. Algebraic and geometric proof systems; 7. Further proof systems; Part II. Upper Bounds: 8. Basic example of the correspondence; 9. Two worlds of bounded arithmetic; 10. Up to EF via the translation; 11. Examples of upper bounds and p-simulations; 12. Beyond EF via the || ... || translation; Part III. Lower Bounds: 13. R and R-like proof systems; 14. LKd+1/2 and combinatorial restrictions; 15. Fd and logical restrictions; 16. Algebraic and geometric proof systems; 17. Feasible interpolation: a framework; 18. Feasible interpolation: applications; Part IV. Beyond Bounds: 19. Hard tautologies; 20. Model theory and lower bounds; 21. Optimality; 22. The nature of proof vomplexity; Bibliography; Special symbols; Index.
Bibliographische Angaben
- Autor: Jan Krajícek
- 534 Seiten, Masse: 16,1 x 24 cm, Gebunden, Englisch
- Verlag: Cambridge University Press
- ISBN-10: 1108416845
- ISBN-13: 9781108416849
- Erscheinungsdatum: 28.03.2019
Sprache:
Englisch
Kommentar zu "Proof Complexity"
0 Gebrauchte Artikel zu „Proof Complexity“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Proof Complexity".
Kommentar verfassen