Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
18
views
0
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,186
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Bounded Arithmetic, Propositional Logic and Complexity Theory
monograph
Author(s):
Jan Krajicek
Publication date
(Online):
December 02 2009
Publisher:
Cambridge University Press
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Author and book information
Book
ISBN (Print):
9780521452052
ISBN (Electronic):
9780511529948
Publication date (Online):
December 02 2009
Publication date (Print):
November 24 1995
DOI:
10.1017/CBO9780511529948
SO-VID:
be3070cd-b5cb-4574-bbb5-b052e84d649b
License:
https://www.cambridge.org/core/terms
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. xiii
Preface
pp. 1
Introduction
pp. 3
Preliminaries
pp. 8
Basic complexity theory
pp. 23
Basic propositional logic
pp. 62
Basic bounded arithmetic
pp. 93
Definability of computations
pp. 102
Witnessing theorems
pp. 132
Definability and witnessing in second order theories
pp. 139
Translations of arithmetic formulas
pp. 185
Finite axiomatizability problem
pp. 210
Direct independence proofs
pp. 232
Bounds for constant-depth Frege systems
pp. 279
Bounds for Frege and extended Frege systems
pp. 299
Hard tautologies and optimal proof systems
pp. 308
Strength of bounded arithmetic
pp. 327
References
Similar content
5,186
A comparative analysis of the weighted arithmetic and Canadian Council of Ministers of the Environment Water Quality Indices for Water Sources in Ohaozara, Ebonyi State, Nigeria
Authors:
Arithmetic operations on generalized trapezoidal fuzzy number and its applications
Authors:
Banerjee
Arithmetic Calculation, Short-Term Memory, and Language Performance in Children With Specific Language Impairment
Authors:
Barbara B. Fazio
See all similar
Cited by
9
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution
Authors:
Sam Buss
,
Nathan Segerlind
,
Russell Impagliazzo
Space Complexity in Propositional Calculus
Authors:
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander Razborov
…
Fixed-Parameter Tractable Reductions to SAT
Authors:
Ronald de Haan
,
Stefan Szeider
See all cited by