LIPIcs - Leibniz International Proceedings in Informatics. Computer Science Logic (CSL\u2712) - 26th International Workshop/21st Annual Conference of the EACSL
Doi
Abstract
We construct theories of Cook-Nguyen style two-sort bounded arithmetic
whose provably total functions are exactly those in LOGCFL and LOGDCFL.
Axiomatizations of both theories are based on the proof tree size
characterizations of these classes. We also show that our theory for LOGCFL proves a certain formulation of the pumping lemma for context-free languages
