Bounded Arithmetic, Propositional Logic and Complexity Theory
Latest Publications

TOTAL DOCUMENTS

17

(FIVE YEARS 0)

H-INDEX

1

(FIVE YEARS 0)

Published By Cambridge University Press

9780521452052, 9780511529948

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

References

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.017 ◽

1995 ◽

pp. 327-334

Download Full-text

Preface

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.001 ◽

1995 ◽

pp. xiii-xv

Download Full-text

Definability and witnessing in second order theories

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.009 ◽

1995 ◽

pp. 132-138

Keyword(s):

Download Full-text

Finite axiomatizability problem

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.011 ◽

1995 ◽

pp. 185-209

Keyword(s):

Finite Axiomatizability

Download Full-text

Definability of computations

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.007 ◽

1995 ◽

pp. 93-101

Download Full-text

Introduction

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.002 ◽

1995 ◽

pp. 1-2 ◽

Download Full-text

Witnessing theorems

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.008 ◽

1995 ◽

pp. 102-131

Download Full-text

Bounds for Frege and extended Frege systems

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.014 ◽

1995 ◽

pp. 279-298

Keyword(s):

Download Full-text

Hard tautologies and optimal proof systems

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.015 ◽

1995 ◽

pp. 299-307

Keyword(s):

Download Full-text

Preliminaries

Bounded Arithmetic, Propositional Logic and Complexity Theory ◽

10.1017/cbo9780511529948.003 ◽

1995 ◽

pp. 3-7

Download Full-text