Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
The Resource Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek
Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek
Resource Information
The item Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- Language
- eng
- Extent
- xiv, 343 pages
- Contents
-
- 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
- Isbn
- 9780521452052
- Label
- Bounded arithmetic, propositional logic, and complexity theory
- Title
- Bounded arithmetic, propositional logic, and complexity theory
- Statement of responsibility
- Jan Krajicek
- Subject
-
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computational complexity
- Computational complexity
- Constructieve wiskunde
- Constructive mathematics
- Constructive mathematics
- Fundamentele informatica
- Logica
- Mathématiques constructives
- Mathématiques constructives
- Propositielogica
- Proposition (Logic)
- Proposition (Logic)
- Proposition (Logique)
- Proposition (logique)
- calcul propositionnel
- complexité calcul
- logique
- théorie complexité
- Arithmétique
- Language
- eng
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Krajíček, Jan
- Index
- index present
- LC call number
- QA9.56
- LC item number
- .K73 1995
- Literary form
- non fiction
- Nature of contents
- bibliography
- http://library.link/vocab/subjectName
-
- Constructive mathematics
- Proposition (Logic)
- Computational complexity
- complexité calcul
- logique
- calcul propositionnel
- théorie complexité
- Mathématiques constructives
- Proposition (Logique)
- Complexité de calcul (Informatique)
- Arithmétique
- Computational complexity
- Constructive mathematics
- Proposition (Logic)
- Logica
- Constructieve wiskunde
- Propositielogica
- Fundamentele informatica
- Mathématiques constructives
- Proposition (logique)
- Complexité de calcul (informatique)
- Label
- Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek
- Bibliography note
- Includes bibliographical references (p. 327-334) and indexes
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 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
- Dimensions
- 24 cm.
- Extent
- xiv, 343 pages
- Isbn
- 9780521452052
- Lccn
- 94047054
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- System control number
-
- (OCoLC)31814801
- (OCoLC)ocm31814801
- Label
- Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek
- Bibliography note
- Includes bibliographical references (p. 327-334) and indexes
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- 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
- Dimensions
- 24 cm.
- Extent
- xiv, 343 pages
- Isbn
- 9780521452052
- Lccn
- 94047054
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- System control number
-
- (OCoLC)31814801
- (OCoLC)ocm31814801
Subject
- Complexité de calcul (Informatique)
- Complexité de calcul (informatique)
- Computational complexity
- Computational complexity
- Constructieve wiskunde
- Constructive mathematics
- Constructive mathematics
- Fundamentele informatica
- Logica
- Mathématiques constructives
- Mathématiques constructives
- Propositielogica
- Proposition (Logic)
- Proposition (Logic)
- Proposition (Logique)
- Proposition (logique)
- calcul propositionnel
- complexité calcul
- logique
- théorie complexité
- Arithmétique
Member of
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Bounded-arithmetic-propositional-logic-and/J6gr9TOEfk4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Bounded-arithmetic-propositional-logic-and/J6gr9TOEfk4/">Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Bounded-arithmetic-propositional-logic-and/J6gr9TOEfk4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Bounded-arithmetic-propositional-logic-and/J6gr9TOEfk4/">Bounded arithmetic, propositional logic, and complexity theory, Jan Krajicek</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>