Bounded arithmetic, propositional logic, and complexity theory / Jan Krajicek.
Material type: TextSeries: Encyclopedia of mathematics and its applicationsPublication details: Cambridge [England] ; New York, NY, USA : Cambridge University Press, 1995Description: xiv, 343 pISBN: 0521452058Subject(s): Constructive mathematics | Proposition (Logic) | Computational complexityLOC classification: QA9.56 | .K73 1995Online resources: Click here to access online | Click here to access onlineItem type | Current library | Collection | Call number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | Main Campus General Collection | General collection | QA9.56 .K73 1995 (Browse shelf(Opens below)) | Available | CN | 13975 |
Browsing Main Campus shelves, Shelving location: General Collection, Collection: General collection Close shelf browser (Hides shelf browser)
QA9.2 .M36 2003 Mathematical logic in the 20th century / | QA9.54 .U54 1992 Normalization, cut-elimination, and the theory of proofs | QA9.54 .W35 1990 Automated proof search in non-classical logics : | QA9.56 .K73 1995 Bounded arithmetic, propositional logic, and complexity theory / | QA10 .D85 2001 Algebraic methods in philosophical logic / | QA11 .C23 1992 Teaching mathematics in secondary and middle school : | QA11 .C655 1999 Connecting mathematics and science to workplace contexts : |
There are no comments on this title.