Logical Foundations of Proof Complexity.

Mostrar otras versiones (1)

A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Cook, Stephen, 1948-
Otros Autores: Nguyen, Phuong, 1977-
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Leiden : Cambridge University Press, 2010.
Temas:
Computational complexity.
Proof theory.
Logic, Symbolic and mathematical.
Complexité de calcul (Informatique)
Théorie de la preuve.
Logique symbolique et mathématique.
Computational complexity
Logic, Symbolic and mathematical
Proof theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 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.

Ejemplares similares