On the Elimination of Iteration Quantifiers in a Fragment of Algorithmic Logic

Abstract In this paper we study the elimination of the iteration quantifier ∪ in a special set of algorithmic formulae. Something similar has been done by G. Mirkowska and E. Orlowska by means of a system of procedures. We, however, show that elimination is already possible by using the programs in our sublanguage itself.