35 citations · 115 across the 15 of their papers we have counts for
6 papers · 1 filter
A simplified lower bound for implicational logic
Emil Jeřábek
We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler's dag-like natural de…
Iterated multiplication in
Emil Jeřábek
We show that , the basic theory of bounded arithmetic corresponding to the complexity class , proves the axiom expressing the totality of iterated mult…
On the proof complexity of logics of bounded branching
Emil Jeřábek
We investigate the proof complexity of extended Frege (EF) systems for basic transitive modal logics (K4, S4, GL, ...) augmented with the bounded branching axioms .…
Proof complexity of intuitionistic implicational formulas
Emil Jeřábek
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies…
A note on the substructural hierarchy
Emil Jeřábek
We prove that all axiomatic extensions of the full Lambek calculus with exchange can be axiomatized by formulas on the level of the substructural hierarchy.
Rules with parameters in modal logic I
Emil Jeřábek
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameter-fr…