Abstract first order computability. I, II

Yiannis N. Moschovakis

Transactions of the American Mathematical Society · 1969 · 139 citations · 14 references

DOIFull text

Open access

Concepts

Abstract

f)x gives the number of the schema involved and that (f)2 is the number of arguments of the function in question.We use a notation convention to which we shall adhere: if a function has been named f, g, h, etc., then an index for it will be/ g, h, etc.The definition of the set PRI of indices is by course of values induction on fe B* and has the following eight clauses.

References

14