Operational Evidence and Incompleteness: A Minkowski Radar Model

Abstract

A uniformly computable family of stationary reflector distances makes finite radar verification of a strict bound equivalent to halting. Every fixed-precision protocol terminates. Nevertheless, every effective theory sound for the corresponding absence statements and their negations leaves infinitely many true absence statements undecided. These are ${\Pi }_1^0$ sentences. The contribution is a simple radar realization of a standard computability obstruction.

arXiv comment4 pages, 1 figure. The first manuscript appeared in November 2025. Feedback on v2 prompted a clearer statement of the effectivity assumptions and the arithmetic form of the absence statements. V3 presents the argument as a short note centered on the radar construction