EBOOK

Bounded Arithmetic, Propositional Logic and Complexity Theory


€ 188,99
 
gebunden
Lieferbar innert 2 Wochen
April 2004

Beschreibung

Beschreibung

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.

Pressestimmen

'This interesting book provides a brisk account of current research in bounded arithmetic and the complexity of propositional logic.' Mathematika 'It can be strongly recommended especially to mathematicians and computer scientists working in the field and to graduate students.' European Mathematical Society Newsletter
EAN: 9780521452052
ISBN: 0521452058
Untertitel: 'Encyclopedia of Mathematics an'. Sprache: Englisch.
Verlag: CAMBRIDGE UNIV PR
Erscheinungsdatum: April 2004
Seitenanzahl: 360 Seiten
Format: gebunden
Es gibt zu diesem Artikel noch keine Bewertungen.Kundenbewertung schreiben