Expressing Program Looping in Regular Dynamic Logic

Abstract ‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Order Dynamic Logic with or without array assignment instructions in the programs. The expressive power of quantifier-free Dynamic Logic increases when nondeterminism is introduced in the programs that are part of formulae of Dynamic Logic. Allowing assignments of random values to variables also increases expressive power.