Bounded arithmetic, propositional logic, and complexity theory - Info and Reading Options
By Jan Krajíček
"Bounded arithmetic, propositional logic, and complexity theory" was published by Cambridge University Press in 1995 - Cambridge [England], it has 343 pages and the language of the book is English.
“Bounded arithmetic, propositional logic, and complexity theory” Metadata:
- Title: ➤ Bounded arithmetic, propositional logic, and complexity theory
- Author: Jan Krajíček
- Language: English
- Number of Pages: 343
- Publisher: Cambridge University Press
- Publish Date: 1995
- Publish Location: Cambridge [England]
“Bounded arithmetic, propositional logic, and complexity theory” Subjects and Themes:
Edition Specifications:
- Pagination: xiv, 343 p. ;
Edition Identifiers:
- The Open Library ID: OL1120584M - OL3526555W
- Online Computer Library Center (OCLC) ID: 31814801
- Library of Congress Control Number (LCCN): 94047054
- ISBN-10: 0521452058
- All ISBNs: 0521452058
AI-generated Review of “Bounded arithmetic, propositional logic, and complexity theory”:
Read “Bounded arithmetic, propositional logic, and complexity theory”:
Read “Bounded arithmetic, propositional logic, and complexity theory” by choosing from the options below.
Search for “Bounded arithmetic, propositional logic, and complexity theory” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Bounded arithmetic, propositional logic, and complexity theory” in Libraries Near You:
Read or borrow “Bounded arithmetic, propositional logic, and complexity theory” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Bounded arithmetic, propositional logic, and complexity theory” at a library near you.
Buy “Bounded arithmetic, propositional logic, and complexity theory” online:
Shop for “Bounded arithmetic, propositional logic, and complexity theory” on popular online marketplaces.
- Ebay: New and used books.