1. Functions equivalent to integer multiplication;Alt,1980
2. Simple programs realize exactly Presburger formulas;Cherniavsky;SIAM J. Comput.,1976
3. A complete and consistent Hoare axiomatics for a simple programming language;Cherniavsky;J. Assoc. Comput. Mach.,1979
4. On the computational complexity of scheme equivalence;Constable,1974
5. Super-Exponential Complexity of Presburger Arithmetic;Fischer,1974