1. L. Banachowski, Investigations of properties of programs by means of extended algorithmic logic, Fundamenta Informaticae I, 1977
2. L. Banachowski, An axiomatic approach to the theory of data structures, Bull.Acad.Pol.Sci.Sèr.Math.Astr.Phys. 23, 1975, 315–323
3. M. Grabowski, The set of tautologies of zero order algorithmic logic is decidable, Bull.Acad.Pol.Sci.Sèr.Math.Astr.Phys. 20, 1972, 575–582
4. D.Harel, A.R.Meyer, V.R.Pratt, Computability and completeness in logic of programs, Proc. 9th Ann. ACM Symp. on Theory of Computing, 261–268
5. A. Kreczmar, Effectivity problems of algorithmic logic, Funda menta Informaticae I, 1977, 19–32