Admissible closures of polynomial time computable arithmetic

Dieter Probst, Thomas Strahm. Admissible closures of polynomial time computable arithmetic. Arch. Math. Log., 50(5-6):643-660, 2011. [doi]

Abstract

Abstract is missing.