No CrossRef data available.
Article contents
Some restrictions on simple fixed points of the integers
Published online by Cambridge University Press: 12 March 2014
Abstract
A function is recursive (in given operations) if its values are computed explicitly and uniformly in terms of other “previously computed” values of itself and (perhaps) other “simultaneously computed” recursive functions. Here, “explicitly” includes definition by cases.
We investigate those recursive functions on the structure N = 〈ω, 0, succ, pred〉 that are computed in terms of themselves only, without other simultaneously computed recursive functions.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1989
References
REFERENCES
Feferman, S. [1966s], Some applications of forcing and generic sets, Fundamenta Mathematicae, vol. 56, pp. 325–345.CrossRefGoogle Scholar
Immerman, N. [1986], Relational queries computable in polynomial time, Information and Control, vol. 68, pp. 86–104.CrossRefGoogle Scholar
Kechris, A. and Moschovakis, Y. [1977], Recursion in higher types, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, pp. 681–737.CrossRefGoogle Scholar
Moschovakis, Y. [1974], Elementary induction on abstract structures, North-Holland, Amsterdam.Google Scholar
Moschovakis, Y. [1983], Abstract recursion as a foundation for the theory of algorithms, Computation and proof theory (Richter, M. M.
et al., editors), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, Berlin, pp. 289–364.CrossRefGoogle Scholar