On the Growth Rate of Certain Combinatorial Functions
Séminaire lotharingien de combinatoire, Tome 22 (1989)
Citer cet article
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
We establish upper and lower bounds for so called Kanamori-McAloon Functions which were studied by Kanamori and McAloon by model theoretic reasoning. The bounds we present fit into the hierarchy concept introduced by Wainer.