Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-30T16:28:51.826Z Has data issue: false hasContentIssue false
  • English
  • Français

Some restrictions on simple fixed points of the integers

Published online by Cambridge University Press:  12 March 2014

G. L. McColm
G. L. McColm*
Affiliation:
Department of Mathematics, University of South Florida, Tampa, Florida 33620
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 54 , Issue 4 , December 1989 , pp. 1324 - 1345
Copyright
Copyright © Association for Symbolic Logic 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

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