Add to ORKGThis book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems
We describe a method of forcing against weak theories of arithmetic and its applications in proposit...
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced b...
Proving formulas in propositional logic can be done in different ways. Some of these are based on of...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
This article surveys R. Parikh’s work on feasibility, bounded arithmetic and the complexity of proof...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractThis article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity ...
We establish new, and surprisingly tight, connections between propositionalproof complexity and fini...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural p...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
Based on the concept of pseudorandom generators, the notation of a generator which is hard for a pro...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
We describe a method of forcing against weak theories of arithmetic and its applications in proposit...
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced b...
Proving formulas in propositional logic can be done in different ways. Some of these are based on of...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
A treatise on bounded arithmetic and propositional proof complexity by the leader in the field
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
This article surveys R. Parikh’s work on feasibility, bounded arithmetic and the complexity of proof...
Proof complexity focuses on the complexity of theorem proving procedures, a topic which is tightly l...
AbstractThis article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity ...
We establish new, and surprisingly tight, connections between propositionalproof complexity and fini...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural p...
A comparative study on the complexity of various procedures for proving that a set of clauses is co...
Based on the concept of pseudorandom generators, the notation of a generator which is hard for a pro...
A possibly unexpected by-product of the mathematical study of the lengths of proofs, as is done in t...
We describe a method of forcing against weak theories of arithmetic and its applications in proposit...
We analyze size and space complexity of Res(k), a family of propositional proof systems introduced b...
Proving formulas in propositional logic can be done in different ways. Some of these are based on of...