Some Completeness Results in the Mathematical Theory of Computation

Authors:
Donald M. Kaplan
Affiliations:
Department of Computer Science, Stanford University, Stanford, California
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 1
Cited 8

Introduction to mathematical logic (3rd ed.)

Introduction to mathematical logic (3rd ed.)

A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers

IEEE Transactions on Software Engineering
Assignment Commands with Array References

Journal of the ACM (JACM)
Verification Decidability of Presburger Array Programs

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fen—an axiomatic basis for program semantics

Communications of the ACM
Comments on the formal treatment of types including sets

ALGOL Bulletin
Bibliography

Record of the Project MAC conference on concurrent systems and parallel computation
Survey: A survey of state vectors

Computer Science Review

Quantified Score

Hi-index	0.02

Visualization

Abstract

A formal theory is described which incorporates the “assignment” function a(i, k, &xgr;) and the “contents” function c(i, &xgr;). The axioms of the theory are shown to comprise a complete and consistent set.