Selected papers that cite this one
- Albert R. Meyer and John C. Mitchell. Termination assertions for recursive programs: Completeness and axiomatic definability. Information and Control, 56(1/2):112-138, January/February 1983.
- Peter H. Schmitt. Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem. Information and Control, 61(2):147-158, May 1984.