Accession Number : AD0785167

Title :   Some Completeness Results in the Mathematical Theory of Computation,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Kaplan,Donald M.

Report Date : 05 OCT 1966

Pagination or Media Count : 24

Abstract : A formal theory is described which incorporates the 'assignment' function a(i,k,xi) and the 'contents' function c(i,xi). The axioms of the theory are shown to comprise a complete and consistent set. (Author)

Descriptors :   *Computations, *Mathematical logic, Set theory, Theorems, Boolean algebra

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE