Parametrization over inductive relations of a bounded number of variables
This paper introduces and applies a version of the Parametrization Theorem for (positive) fixedpoint inductions - of a bounded number of variables. First, the ``number of variables'' measure of complexity is proved nontrivial, on classes of finite structures admitting unbounded inductions, and a conjecture on such classes is proposed. The closure ordinals and saturation of models are examined, and the paper concludes with a glance at the Spector-Gandy Theorem.
parametrization theorem for fixed point inductions
classes of finite structures admitting unbounded inductions
scientific article; zbMATH DE number 4156421
scientific article