Establish a complete axiomatization of EDMon-valid formulas

Establish whether the set of EDMon-valid formulas admits a complete axiomatization, or otherwise characterize the limitations that prevent such an axiomatization.

Background

The paper develops a partial collection of EDMon-valid axioms and inference rules by relating EDMon to LTL, propositional dynamic logic with converse, and specialized properties of its mutation and observation modalities. These results provide several important classes of validities but do not characterize all EDMon-valid formulas.

The authors explicitly express doubt that a complete axiomatization is possible, while still presenting the partial axiomatization as a way to make progress. Determining the exact axiomatizability status of EDMon-validity remains unresolved in the paper.

References

Giving a complete axiomatization of the set of EDMon-valid formulas is probably impossible.

— A Formal Framework for Noisy Runtime Verification  (2609.10462 - Logan et al., 9 Sep 2026) in Section “Some EDMon Validities”