Model existence theorem in algorithmic logic with non-deterministic programs1
Grażyna Mirkowska · Fundamenta Informaticae · 1980
The paper is a continuation of the considerations connected with non-deterministic algorithmic logic. We will formulate a Hilbert style axiomatization basing on the analogous one defined for algorithmic logic. The main result is the theorem asserting that every consistent non-deterministic algorithmic theory possesses a model.