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
11 Persistent and invariant formulas relative to theories of higher order – S Feferman, G Kreisel - 1966
19 Persistent and invariant formulas for outer extensions – S Feferman - 1968
43 Model theory for extended modal languages – B ten Cate - 2005
100 Hybrid Logics: Characterization, Interpolation and Complexity – Carlos Areces, Patrick Blackburn, Maarten Marx - 1999
10 Natural deduction for hybrid logics – T Brauner
40 Hierarchies of Modal and Temporal Logics with Reference Pointers – Valentin Goranko - 1995
74 Internalizing Labelled Deduction – Patrick Blackburn - 2000
106 Hybrid Languages – Patrick Blackburn, Jerry Seligman - 1995
74 and V.Goranko. Modal logic with names – G Gargov - 1993
443 Modal Logic – P Blackburn, M de Rijke, Y Venema - 2001
49 Papers on Time and Tense – A N Prior - 1968
64 An essay in combinatory dynamic logic – S Passy, T Tinchev - 1991
180 Past, Present and Future – A N Prior - 1967
193 Admissible Sets and Structures – J Barwise - 1975
34 Propositional quantifiers in modal logic – K Fine - 1970
36 Hybrid languages and temporal logic – Patrick Blackburn, Miroslava Tzakova, In Memory Of George Gargov - 1999
34 An approach to tense logic – R A Bull - 1970
9 Interpolation for extended modal languages – Balder Ten Cate