Bounded Arithmetic and Propositional Proof Complexity (1995)

by Samuel R. Buss
Venue:in Logic of Computation
Citations:12 - 0 self

Documents Related by Co-Citation

483 Modal Logic – P Blackburn, M de Rijke, Y Venema - 2001
20 Persistent and invariant formulas for outer extensions – S Feferman - 1969
11 G.: Persistent and invariant formulas relative to theories of higher order – S Feferman, Kreisel - 1966
7 Constructive Interpolation in Hybrid Logic – Patrick Blackburn, Maarten Marx - 2002
644 A Mathematical Introduction to Logic – H B Enderton - 1972
476 Knowledge and Belief – Jaakko Hintikka - 1962
830 The complexity of theorem-proving procedures – Stephen A. Cook - 1971
621 An overview of the KL-ONE knowledge representation system – James G. Schmolze, Bolt Beranek, Newman Inc - 1985
888 Dynamic Logic – David Harel, Dexter Kozen, Jerzy Tiuryn - 1984