Some Completeness Results in the Mathematical Theory of Computation
Donald M. Kaplan · Journal of the ACM · 1968
A formal theory is described which incorporates the “assignment” function a ( i , k , ξ ) and the “contents” function c ( i , ξ ). The axioms of the theory are shown to comprise a complete and consistent set.