Axiomatizing proof tree concepts in Bounded Arithmetic

Satoru Kuroda. Axiomatizing proof tree concepts in Bounded Arithmetic. In Patrick Cégielski, Arnaud Durand, editors, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France. Volume 16 of LIPIcs, pages 440-454, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Abstract

Abstract is missing.