Algorithmic logic with nondeterministic programs¹

Article type: Research Article

Authors: Mirkowska, Grażyna

Affiliations: University of Warsaw

Note: [1] This research was partially supported by the Polish Academy of Sciences under contract MI. 3/04.7.1.

Abstract: Algorithmic properties of nondeterministic programs are studied and axiomatized completely. Nondeterministic programs require two kinds of algorithmic formulas describing their behaviour: ΔKa – all computations of the program K are finite and all results satisfy a and ∇Ka – there exists a finite computation such that its result satisfies the formula a.

Keywords: nondeterministic program, algorithmic logic, completeness

DOI: 10.3233/FI-1980-3105

Journal: Fundamenta Informaticae, vol. 3, no. 1, pp. 45-64, 1980