29 citations · 35 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2014★ 4 cited
Open induction in a bounded arithmetic for TC^0
Emil Jeřábek
The elementary arithmetic operations on integers are well-known to be computable in the weak complexity class , and it is a basic question what propert…
cs.LO2011★ 29 cited
Blending margins: The modal logic K has nullary unification type
Emil Jeřábek
We investigate properties of the formula in the basic modal logic K. We show that K satisfies an infinitary weaker variant of the rule of margins $ϕ\to \Boxϕ/ ϕ, \ne…