On the finite axiomatizability of the visibility relation over radars (Q2822172)

In this paper, a geometric model for agents participating in visability relations is proposed. The author studies the general laws for visability relations in the sense of finite universal axiomatizability. First, the model under consideration is defined. Then, the logical problem of universal axiomatizability \( {\mathcal U}_{\mathrm{rad}} \) is reduced to the combinatorial problem of constructing arbitrary large noncompact graphs, and it is reduced to a geometric construction \( G \). Finally, is is proved that no finite universal axiomatization of \( {\mathcal U}_{\mathrm{rad}} \) is possible in the cases \( n=1 \), \( n= \).