Undecidable theories in stationary logic
Detlef G. Seese, Peter Tuschik, Martin Weese · Proceedings of the American Mathematical Society · 1982
It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs.