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.
On the Theory of Order Over Real Numbers. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-025-00624-2. – URL: https://link.springer.com/article/10.1007/s11786-025-00624-2
(2026). On the Theory of Order Over Real Numbers. Bulletin of Materials Science. https://doi.org/10.1007/s11786-025-00624-2
“On the Theory of Order Over Real Numbers.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-025-00624-2.
@article{article34445,
title = {On the Theory of Order Over Real Numbers},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-025-00624-2},
url = {https://link.springer.com/article/10.1007/s11786-025-00624-2}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...