Parametrization over Inductive Relations of a Bounded Number of Variables

Abstract We present a Parametrization Theorem for (positive elementary) inductions that use a bounded number of variables. We investigate associated halting problem(s) on classes of finite structures and on solitary ‘unreasonable’ structures. These results involve the complexity of the inductive relations—and the complexity of the structure or class of structures on which these relations live. We also apply this Parametrization Theorem to Moschovakis closure ordinals, to determine when the closure ordinal is greater than ω, and to investigate the closure ordinals of unreasonable structures.

[1]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[2]  Gregory L. McColm.  Simple and simultaneous recursive fixed points , 1986 .

[3]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[4]  S. C. Kleene,et al.  A note on function quantification , 1957 .

[5]  Yiannis N. Moschovakis,et al.  Recursion in Higher Types , 1977 .

[6]  S. Feferman.  Some applications of the notions of forcing and generic sets , 1964 .

[7]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[8]  Charles Landraitis.  Definability in Well Quasi-Ordered Sets of Structures , 1977, J. Symb. Log..

[9]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[10]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[11]  Gregory L. McColm.  When Is Arithmetic Possible? , 1990, Ann. Pure Appl. Log..

[12]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[14]  S. Kleene.  Hierarchies of number-theoretic predicates , 1955 .

[15]  S. Kleene.  On the Forms of the Predicates in the Theory of Constructive Ordinals , 1944 .

[16]  Yiannis N. Moschovakis,et al.  Abstract recursion as a foundation for the theory of algorithms , 1984 .

[17]  S. Kleene.  On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) , 1955 .

[18]  Allan Borodin,et al.  Computational Complexity and the Existence of Complexity Gaps , 1972, JACM.