On the Theory of Order Over Real Numbers

Bulletin of Materials Science · Springer Nature · 2026-04-03 · DOI: 10.1007/s11786-025-00624-2

Аннотация

We consider the first-order theory of order over real numbers extended with monadic uninterpreted predicates. It has long been established that this theory is decidable, by different approaches such as a reduction to linear-time temporal logic over the reals, expressing the problem as a particular case of deciding the first-order theory of all linear orderings, or reasoning about restrictions of the monadic second-order theory of order. The main contribution of this work is to provide a complete self-contained proof of decidability for this logic. Additionally, our proof develops a symbolic notation system for models of satisfiable formulas, which can be seen as a first step towards an actual implementation of a decision procedure for the theory of order over the reals.

Читать у издателя →

Похожие статьи