35 citations · 115 across the 15 of their papers we have counts for
Showing 2020 · cs.LOShow all
2 papers · 2 filters
cs.LO2020
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…
cs.LO2020
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 .…