10 citations · 22 across the 22 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.LO2012
A Simplified Characterisation of Provably Computable Functions of the System ID_1 of Inductive Definitions
Naohi Eguchi, Andreas Weiermann
We present a simplified and streamlined characterisation of provably total computable functions of the theory ID_1 of non-iterated inductive definitions. The idea of the simplifica…
cs.LO2012★ 5 cited
Derivation Lengths Classification of Gödel's T Extending Howard's Assignment
Gunnar Wilken, Andreas Weiermann
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multival…