1. Decidability and expressiveness for first-order logics of probability;Abadi;Inf. Comput.,1994
2. The art gallery problem is ∃R-complete;Abrahamsen,2018
3. Training neural networks is ∃R-complete;Abrahamsen,2021
4. Nomogramme, Gewebe, und Quasigruppen;Aczél;Mathematica (Cluj),1960
5. ∃R-complete decision problems about symmetric Nash equilibria in symmetric multi-player games;Bilò,2017