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

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

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