Unbounded program memory adds to the expressive power of first-order programming logic

doi:10.1016/S0019-9958(84)80020-0

Information and Control

Volume 60, Issues 1–3, January–March 1984, Pages 12-35

Information and Cont...

https://doi.org/10.1016/S0019-9958(84)80020-0 Get rights and content

Under an Elsevier user license

open archive

It is proved that no logic of programs with unbounded memory is reducible to a bounded memory programming logic. This is achieved by carefully analyzing firstorder definability in the algebra of finite binary trees.

Cited by (0)

^*: This work was supported in part by the National Science Foundation Grant MCS 8010707, and by a grant to the MIT Laboratory for Computer Science by the IBM Corporation.

^†: An extended abstract of this paper has been presented at the 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tenn., October 1981.

Information and Control

Unbounded program memory adds to the expressive power of first-order programming logic*,†