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 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.

Algorithmic Procedures

Harvey Friedman and Richard Mansfield
Transactions of the American Mathematical Society
Vol. 332, No. 1 (Jul., 1992), pp. 297-312
DOI: 10.2307/2154033
Stable URL: http://www.jstor.org/stable/2154033
Page Count: 16
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
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.
Algorithmic Procedures
Preview not available

Abstract

We consider the state of elementary recursion theory when the familiar $0, 1, +, \times, =, <$ of ordinary arithmetic are replaced by constants, functions, and relations from an arbitrary model.

Page Thumbnails

  • Thumbnail: Page 
297
    297
  • Thumbnail: Page 
298
    298
  • Thumbnail: Page 
299
    299
  • Thumbnail: Page 
300
    300
  • Thumbnail: Page 
301
    301
  • Thumbnail: Page 
302
    302
  • Thumbnail: Page 
303
    303
  • Thumbnail: Page 
304
    304
  • Thumbnail: Page 
305
    305
  • Thumbnail: Page 
306
    306
  • Thumbnail: Page 
307
    307
  • Thumbnail: Page 
308
    308
  • Thumbnail: Page 
309
    309
  • Thumbnail: Page 
310
    310
  • Thumbnail: Page 
311
    311
  • Thumbnail: Page 
312
    312