Access

You are not currently logged in.

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

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

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
  • Read Online (Free)
  • Download ($10.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Some Restrictions on Simple Fixed Points of the Integers
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.

Page Thumbnails

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