Bounded arithmetic, propositional logic, and complexity theory

Author(s)

• Krajíček, Jan

Bibliographic Information

Bounded arithmetic, propositional logic, and complexity theory

Jan Krajíček

（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, v. 60）

Cambridge University Press, 1995

Note

Includes bibliographical references (p. 327-334) and indexes

Details

• NCID: BA26572058
• ISBN:
  • 0521452058
• LCCN: 94047054
• Country Code: uk
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Cambridge, England ; New York
• Pages/Volumes: xiv, 343 p.
• Size: 24 cm
• Classification:
  • LCC : QA9.56
  • DC20 : 511.3
  • NDC8 : 410.96
• Subject Headings:
  • LCSH : Constructive mathematics
  • LCSH : Proposition (Logic)
  • LCSH : Computational complexity
• Parent Bibliography ID:
  • BA00064663