Parametrization over inductive relations of a bounded number of variables

This publication has 15 references indexed in Scilit:

• When is arithmetic possible?
  Annals of Pure and Applied Logic, 1990
• Relational queries computable in polynomial time
  Information and Control, 1986
• On Moschovakis closure ordinals
  The Journal of Symbolic Logic, 1977
• Computational Complexity and the Existence of Complexity Gaps
  Journal of the ACM, 1972
• Abstract first order computability. II
  Transactions of the American Mathematical Society, 1969
• A Machine-Independent Theory of the Complexity of Recursive Functions
  Journal of the ACM, 1967
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965
• A note on function quantification
  Proceedings of the American Mathematical Society, 1957
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
  American Journal of Mathematics, 1955
• Hierarchies of number-theoretic predicates
  Bulletin of the American Mathematical Society, 1955