Bücher online kaufen
Bounded Arithmetic, Propositional Logic and Complexity Theory
Langbeschreibung
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
Inhaltsverzeichnis
1. Introduction; 2. Preliminaries; 3. Basic complexity theory; 4. Basic propositional logic; 5. Basic bounded arithmetic; 6. Definability of computations; 7. Witnessing theorems; 8. Definability and witnessing in second order theories; 9. Translations of arithmetic formulas; 10. Finite axiomatizability problem; 11. Direct independence proofs; 12. Bounds for constant-depth Frege systems; 13. Bounds for Frege and extended Frege systems; 14. Hard tautologies and optimal proof systems; 15. Strength of bounded arithmetic; References; Index.
ISBN-13:
9780521452052
Veröffentl:
2004
Erscheinungsdatum:
08.04.2004
Seiten:
360
Autor:
Jan Krajicek
Gewicht:
737 g
Format:
235x157x26 mm
Sprache:
Englisch
203,10 €*
Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktageni
Alle Preise inkl. MwSt.
| zzgl. Versand