Infinite arithmetic formulas and the reflection principle

An extension of the language of arithmetic is constructed such that it allows us to work with recursive sequences of arithmetic formulas as if it were a single formula. It is proved that Feferman's reflection principles are inferable in the extension obtained. Supported by the Competitive Center for Basic Research (CCBR), grant No. 93-1-88-12. Translated fromAlgebra i Logika, Vol. 36, No. 3, pp. 245–258, May–June, 1997.