Bounded minimalisation and bounded counting in argument-bounded idc's
Mathias Barra · Mathematical Structures in Computer Science · 2010
We define and investigate a number of small inductively defined classes (idc's),à laGregorczyk, that are based onargument-boundedinitial functions and thebounded minimalisationandbounded countingschemata. We establish equivalences between these and other classes in the literature, with an emphasis on minimalism. We also obtain characterisations of the classes in terms of well-known fragments of first-order predicate logic.