Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-17T20:29:49.837Z 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.

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

Footnotes

1

This paper was prepared while I was employed at the Avion Division of ACF Industries, Inc., and was presented at a meeting of the Association for Symbolic Logic, December 29, 1955. I am greatly indebted to Professor Alonzo Church for his help in the development of this material.

References

2 (Added August 5, 1957.) The referee has pointed out that the system rra is equivalent to the earlier formulation of well-formed nets given in Burks, A. W. and Wright, J. B., Theory of logical nets, Proceedings of the Institute of Radio Engineers, vol. 41 (1953), pp. 13571365Google Scholar. Through this equivalence the present paper provides a solution to the decision problem for well-formed nets.

3 The symbol “V” is used for disjunction, and juxtaposition is used for conjunction.