Bounded Arithmetic and Propositional Proof Complexity (1995)

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

Documents Related by Co-Citation

7 Constructive Interpolation in Hybrid Logic – Patrick Blackburn, Maarten Marx - 2002
18 Persistent and invariant formulas for outer extensions – S Feferman - 1968
11 Persistent and invariant formulas relative to theories of higher order – S Feferman, G Kreisel - 1966
38 Model theory for extended modal languages – Balder ten Cate - 2005
94 Hybrid Logics: Characterization, Interpolation and Complexity – Carlos Areces, Patrick Blackburn, Maarten Marx - 1999
72 Modal logic with names – G Gargov, V Goranko - 1993
70 Internalizing Labelled Deduction – Patrick Blackburn - 2000
40 Hierarchies of Modal and Temporal Logics with Reference Pointers – Valentin Goranko - 1995
95 Hybrid Languages – Patrick Blackburn, Jerry Seligman - 1995
9 Natural deduction for hybrid logics – T Braüner
353 Modal Logic – P Blackburn, M de Rijke, Y Venema - 2001
61 An essay in combinatory dynamic logic – S Passy, T Tinchev - 1991
39 Papers on Time and Tense – A Prior - 1968
154 Present and Future – Past - 1967
171 Admissible Sets and Structures – Jon Barwise - 1975
23 Propositional quantifiers in modal logic – Kit Fine - 1970
32 Hybrid languages and temporal logic – Patrick Blackburn, Miroslava Tzakova, In Memory Of George Gargov - 1999
33 An approach to tense logic – R Bull - 1970
4 Expressivity of second-order propositional modal logic – B ten Cate