35 citations · 115 across the 15 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 5 cited
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…
cs.LO2015★ 9 cited
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.