## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# Some Restrictions on Simple Fixed Points of the Integers

G. L. McColm
The Journal of Symbolic Logic
Vol. 54, No. 4 (Dec., 1989), pp. 1324-1345
DOI: 10.2307/2274817
Stable URL: http://www.jstor.org/stable/2274817
Page Count: 22
Preview not available

## 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 $\mathbf{N} = \langle \omega, 0, \operatorname{succ,pred}\rangle$ that are computed in terms of themselves only, without other simultaneously computed recursive functions.

• 1324
• 1325
• 1326
• 1327
• 1328
• 1329
• 1330
• 1331
• 1332
• 1333
• 1334
• 1335
• 1336
• 1337
• 1338
• 1339
• 1340
• 1341
• 1342
• 1343
• 1344
• 1345