1. H. Andreka, J. Nemeti, and J. Sain, “On the strength of temporal proof,” Lect. Notes Comput. Sci., 379, 135–144 (1989).
2. L. Banachowski, A. Kreczmar, G. Mirkowska, H. Rasiowa, and A. Salwicki, “An introduction to algorithmic logic: mathematical investigations in the theory of programs,” Math. Found. Comp. Sci., 2, 7–99 (1977).
3. A. Degtyarev and A. Voronkov, “Decidability problems for the prenex fragment of intuitionistic logic,” in: 11th Annual IEEE Symposium on Logic in Computer Science (1996), IEEE Comput. Soc. Press, Los Alamos (1996), pp. 503–512.
4. A. G. Dragalin, “Completeness of arithmetic with constructive rule of infinite induction [in Russian],” in: Theory of Algorithms and Mathematical Logic, Moscow (1974), pp. 14–32.
5. R. Dyckhoff, “Contraction-free sequent calculi for intuitionistic logic,” J. Symbolic Logic, 57, 795–807 (1972).