Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T14:10:59.341Z Has data issue: false hasContentIssue false

Some results in church's restricted recursive arithmetic1

Published online by Cambridge University Press:  12 March 2014

Joyce Friedman*
Affiliation:
Washington, D.C.

Extract

Alonzo Church has proposed a system of “restricted recursive arithmetic” for the analysis of computer circuits which include time delays and feedback. Restricted recursive arithmetic, which will be referred to as rra, was introduced by Church in this Journal, vol. 20 (1955), pp. 286–287, in a review of an article by Edmund C. Berkeley. It is the purpose of this paper to present some results which have been found for the system rra.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1957

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